1865 search results - page 268 / 373 » Pan-Private Streaming Algorithms |
150
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
132
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
123
Voted
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— In mobile robotics, the segmentation of range data is an important prerequisite to object recognition and environment understanding. This paper presents an algorithm for realti...
117
Voted
CIDM
2007
IEEE
15 years 10 months ago
2007
IEEE
— There are several types of processes which can be modeled explicitly by recording the interactions between a set of actors over time. In such applications, a common objective i...
125
click to vote
ICNP
1997
IEEE
15 years 7 months ago
1997
IEEE
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...