Sciweavers

13621 search results - page 2647 / 2725
» Computability and Complexity in Self-assembly
Sort
View
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 4 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
COLT
1993
Springer
15 years 4 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
164
Voted
AII
1992
15 years 4 months ago
Learning from Multiple Sources of Inaccurate Data
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
Ganesh Baliga, Sanjay Jain, Arun Sharma
105
Voted
ISER
1993
Springer
141views Robotics» more  ISER 1993»
15 years 4 months ago
Experimental Integration of Planning in a Distributed Control System
This paper describes a complete system architecture integrating planning into a two-armed robotic workcell. The system is comprised of four major components: user interface, plann...
Gerardo Pardo-Castellote, Tsai-Yen Li, Yoshihito K...
106
Voted
POPL
1994
ACM
15 years 4 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
« Prev « First page 2647 / 2725 Last » Next »