Sciweavers

21324 search results - page 4157 / 4265
» Making the case for computing
Sort
View
EDBT
2008
ACM
137views Database» more  EDBT 2008»
15 years 10 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
PERCOM
2007
ACM
15 years 9 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
MOBISYS
2008
ACM
15 years 9 months ago
Peopletones: a system for the detection and notification of buddy proximity on mobile phones
Mobile phones have the potential to be useful agents for their owners by detecting and reporting situations that are of interest. Several challenges emerge in the case of detectin...
Kevin A. Li, Timothy Sohn, Steven Huang, William G...
MOBISYS
2006
ACM
15 years 9 months ago
Feasibility study of mesh networks for all-wireless offices
There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, ...
Jakob Eriksson, Sharad Agarwal, Paramvir Bahl, Jit...
MOBIHOC
2008
ACM
15 years 9 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
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...
Yiwei Wu, Yingshu Li
« Prev « First page 4157 / 4265 Last » Next »