1086 search results - page 140 / 218 » Jug measuring: Algorithms and complexity |
155
click to vote
SPATIALCOGNITION
2000
Springer
15 years 5 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
132
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
123
click to vote
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
113
click to vote
ICRA
2009
IEEE
14 years 11 months ago
2009
IEEE
In a previous paper, we developed a robotic finger equipped with optical three-axis tactile sensors, of which the sensing cell can separately detect normal and shearing forces. Wit...