Sciweavers

62 search results - page 2 / 13
» Near Optimal Update-Broadcast of Data Sets
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
13 years 11 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
JMLR
2008
159views more  JMLR 2008»
13 years 6 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
DAGM
2006
Springer
13 years 10 months ago
Near Real-Time Motion Segmentation Using Graph Cuts
We present a new approach to integrated motion estimation and segmentation by combining methods from discrete and continuous optimization. The velocity of each of a set of regions ...
Thomas Schoenemann, Daniel Cremers
NIPS
2004
13 years 7 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
CIKM
2001
Springer
13 years 10 months ago
A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels
In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data disse...
Chih-Hao Hsu, Guanling Lee, Arbee L. P. Chen