11160 search results - page 245 / 2232 » Incompleteness in a General Setting |
172
click to vote
TPDS
1998
15 years 5 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
174
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
181
Voted
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
128
click to vote
FOCS
2008
IEEE
16 years 9 days ago
2008
IEEE
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
161
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...