Sciweavers

2569 search results - page 139 / 514
» Approximate Objects and Approximate Theories
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
ICALP
2010
Springer
15 years 11 months ago
Clustering with Diversity
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
Jian Li, Ke Yi, Qin Zhang
ICML
2010
IEEE
15 years 7 months ago
Accelerated dual decomposition for MAP inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
Vladimir Jojic, Stephen Gould, Daphne Koller
ADHOC
2008
96views more  ADHOC 2008»
15 years 6 months ago
Network configuration for optimal utilization efficiency of wireless sensor networks
This paper addresses the problem of configuring wireless sensor networks (WSNs). Specifically, we seek answers to the following questions: how many sensors should be deployed, wha...
Yunxia Chen, Chen-Nee Chuah, Qing Zhao