Sciweavers

1161 search results - page 65 / 233
» Approximation schemes for clustering problems
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Approximation Algorithms for Data Broadcast in Wireless Networks
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu,...
FUIN
2010
143views more  FUIN 2010»
14 years 7 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
TNN
2010
216views Management» more  TNN 2010»
14 years 4 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ADHOC
2010
292views more  ADHOC 2010»
14 years 10 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff