118 search results - page 20 / 24 » Fast Algorithms for Constant Approximation k-Means Clusterin... |
112
click to vote
STOC
2005
ACM
15 years 12 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
110
click to vote
STOC
2005
ACM
15 years 5 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
ICAD
2004
15 years 1 months ago
2004
This paper discusses the responsive sound installation Reeds. The Melbourne International Festival of the Arts commissioned the Reeds project in 2000, for exhibition on the Orname...
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...