Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Jeffrey Considine"'
Publikováno v:
ACM Transactions on Database Systems. 34:1-35
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collect. An approach to this data management problem is the use of sensor dat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37dd1a06bb531197e558f88d85828949
https://doi.org/10.1145/1508857.1508863
https://doi.org/10.1145/1508857.1508863
Publikováno v:
Computer Communications. 29:280-290
Content providers often consider the costs of security to be greater than the losses they might incur without it; many view 'casual piracy' as their main concern. Our goal is to provide a low cost defense against such attacks while maintaining rigoro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::184b2cc91c92466b90f295400cdeaac5
https://doi.org/10.1016/j.comcom.2004.12.007
https://doi.org/10.1016/j.comcom.2004.12.007
Publikováno v:
ACM SIGCOMM Computer Communication Review. 34:137-142
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, with the availability of wide-area distributed testbeds such as PlanetLab,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::606e9a35ab18701c6c3ddbcfd0f7c004
https://doi.org/10.1145/972374.972398
https://doi.org/10.1145/972374.972398
Autor:
Jeffrey Considine, Ueli Maurer, Matthias Fitzi, Leonid A. Levin, David Metcalf, Matthew K. Franklin
Publikováno v:
Journal of Cryptology, 18 (3)
Journal of Cryptology, 18 (3)
ISSN:1432-1378
ISSN:0933-2790
ISSN:1432-1378
ISSN:0933-2790
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73bfe776b1108c792d64449eab276a04
https://hdl.handle.net/20.500.11850/32281
https://hdl.handle.net/20.500.11850/32281
Publikováno v:
ICDE
Scopus-Elsevier
Scopus-Elsevier
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of mobile users covered by a cell, traffic volume in a district, etc.). Exi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f15f00ff9fe3117c970c841abce5c50
https://doi.org/10.1109/icde.2004.1319998
https://doi.org/10.1109/icde.2004.1319998
Publikováno v:
ICDE
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collect. An approach to this data management problem is the use of sensor dat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::871977aaebe89e7e2687a7b6c363bc9b
https://doi.org/10.1109/icde.2004.1320018
https://doi.org/10.1109/icde.2004.1320018
Publikováno v:
SPAA
A well-known paradigm for load balancing in parallel and distributed systems is the "power of two choices," whereby an item is stored at the less loaded of two (or more) random alternative servers. We investigate the power of two choices in natural s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc5152465ebfc96fbb5f71301036ec1c
https://doi.org/10.1145/1007912.1007921
https://doi.org/10.1145/1007912.1007921
Publikováno v:
DMSN
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use in-network aggregation of respons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9781305de70da8c31cd1871fdd78a138
https://doi.org/10.1145/1052199.1052206
https://doi.org/10.1145/1052199.1052206
Publikováno v:
POPL
The first order isomorphism problem is to decide whether two non-recursive types using product- and function-type constructors, are isomorphic under the axioms of commutative and associative products, and currying and distributivity of functions over
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c15edd994500dc7f112e0cbeeeb6700f
https://doi.org/10.1145/604131.604146
https://doi.org/10.1145/604131.604146
Publikováno v:
Peer-to-Peer Systems II ISBN: 9783540407249
IPTPS
IPTPS
Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::367d066e189bc08669b52971b80aa565
https://doi.org/10.1007/978-3-540-45172-3_7
https://doi.org/10.1007/978-3-540-45172-3_7