33 search results - page 5 / 7 » Set Covering with our Eyes Closed |
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
DAGM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
117
click to vote
CICLING
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Semantic inference is an important component in many natural language understanding applications. Classical approaches to semantic inference rely on logical representatio...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
EENERGY
2010
15 years 1 months ago
2010
As energy-related costs have become a major economical factor for IT infrastructures and data-centers, companies and the research community are being challenged to find better an...