Sciweavers

5785 search results - page 205 / 1157
» Approximability of Probability Distributions
Sort
View
MOBIHOC
2008
ACM
16 years 3 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
GLOBECOM
2007
IEEE
15 years 10 months ago
Minimizing Distribution Cost of Distributed Neural Networks in Wireless Sensor Networks
Abstract—This paper presents a novel study on how to distribute neural networks in a wireless sensor networks (WSNs) such that the energy consumption is minimized while improving...
Peng Guan, Xiaolin Li
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
16 years 5 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 5 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 4 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra