323 search results - page 21 / 65 » Exact Approximations of omega Numbers |
COMGEO
2007
ACM
14 years 9 months ago
2007
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
DLT
2003
14 years 11 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
115
click to vote
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
100
click to vote
TROB
2010
14 years 8 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...