2168 search results - page 347 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
140
click to vote
MOBISYS
2007
ACM
16 years 4 months ago
2007
ACM
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is acc...
207
click to vote
MOBIHOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
160
click to vote
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
142
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
173
click to vote
MOBICOM
2012
ACM
13 years 7 months ago
2012
ACM
As we are surrounded by an ever-larger variety of post-PC devices, the traditional methods for identifying and authenticating users have become cumbersome and time-consuming. In t...