Sciweavers

1772 search results - page 285 / 355
» Classifying Problems into Complexity Classes
Sort
View
ECML
2007
Springer
14 years 4 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
HAPTICS
2003
IEEE
14 years 3 months ago
The Haptic Probe: Mechanized Haptic Exploration and Automated Modeling
It seems likely that humans build internal models of objects that they explore haptically, and that the complexity of an internal model is not necessarily associated with complex ...
Volkan Patoglu, R. Brent Gillespie
VLSID
1999
IEEE
91views VLSI» more  VLSID 1999»
14 years 2 months ago
Timed Circuit Synthesis Using Implicit Methods
The design and synthesis of asynchronous circuits is gaining importance in both the industrial and academic worlds. Timed circuits are a class of asynchronous circuits that incorp...
Robert Thacker, Wendy Belluomini, Chris J. Myers
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
14 years 4 days ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
NIPS
2007
13 years 11 months ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...