Sciweavers

20175 search results - page 3941 / 4035
» Is abstraction the key to computing
Sort
View
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
VLDB
2008
ACM
170views Database» more  VLDB 2008»
14 years 10 months ago
A multi-ranker model for adaptive XML searching
The evolution of computing technology suggests that it has become more feasible to offer access to Web information in a ubiquitous way, through various kinds of interaction device...
Ho Lam Lau, Wilfred Ng
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 10 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
« Prev « First page 3941 / 4035 Last » Next »