1469 search results - page 189 / 294 » Approximate polynomial decomposition |
213
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
174
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
— As the technology scales into 90nm and below, process-induced variations become more pronounced. In this paper, we propose an efficient stochastic method for analyzing the vol...
182
click to vote
ICIP
2007
IEEE
16 years 22 days ago
2007
IEEE
In this paper, we propose a distributed compression approach for multi-view images, where each camera efficiently encodes its visual information locally without requiring any col...
159
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
186
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...