2168 search results - page 50 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
COLT
2000
Springer
14 years 1 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
- Stable and effective enforcement of hard constraints is one of the crucial components in controlling physics-based dynamic simulation systems. The conventional explicit Baumgarte...
DAC
2010
ACM
13 years 9 months ago
2010
ACM
The performance of most embedded systems is critically dependent on the average memory access latency. Improving the cache hit rate can have significant positive impact on the per...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
ACL
2012
11 years 11 months ago
2012
We present a novel algorithm for multilingual dependency parsing that uses annotations from a diverse set of source languages to parse a new unannotated language. Our motivation i...