Sciweavers

242 search results - page 20 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
SENSYS
2003
ACM
14 years 3 months ago
Spatiotemporal multicast in sensor networks
Sensor networks often involve the monitoring of mobile phenomena. We believe this task can be facilitated by a spatiotemporal multicast protocol which we call “mobicast”. Mobi...
Qingfeng Huang, Chenyang Lu, Gruia-Catalin Roman
COMSWARE
2007
IEEE
14 years 4 months ago
Impact of Network Dynamics on Tardiness of Data in Sensor Networks
- Impact of random delays and losses in sensor networks manifests in the form of tardiness of data used for processing at the sink nodes. The age of data used by the end applicatio...
Tarun Banka, Anura P. Jayasumana
ILP
2004
Springer
14 years 3 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
FOCS
2008
IEEE
14 years 4 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 10 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran