Sciweavers

3208 search results - page 156 / 642
» A Lower Bound for Primality
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Testing Juntas
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra...
COLT
2001
Springer
15 years 11 months ago
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
Sanjay Jain, Efim B. Kinber
ICCAD
1997
IEEE
131views Hardware» more  ICCAD 1997»
15 years 10 months ago
COSMOS: a continuous optimization approach for maximum power estimation of CMOS circuits
Maximum instantaneous power in VLSI circuits has a great impact on circuit's reliability and the design of power and ground lines. To synthesizehighlyreliablesystems,accurate...
Chuan-Yu Wang, Kaushik Roy
EOR
2007
82views more  EOR 2007»
15 years 6 months ago
The equitable location problem on the plane
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
Opher Baron, Oded Berman, Dmitry Krass, Qian Wang
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 6 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri