Sciweavers

17082 search results - page 3309 / 3417
» Abstractions for Mobile Computation
Sort
View
ICALP
2009
Springer
14 years 10 months ago
Sorting and Selection with Imprecise Comparisons
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
Avinatan Hassidim, Jelani Nelson, Miklós Aj...
ICALP
2009
Springer
14 years 10 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
ICALP
2009
Springer
14 years 10 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 10 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
VLDB
2006
ACM
138views Database» more  VLDB 2006»
14 years 10 months ago
Succinct representation of flexible and privacy-preserving access rights
Abstract We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access contr...
Marina Blanton, Mikhail J. Atallah
« Prev « First page 3309 / 3417 Last » Next »