1672 search results - page 212 / 335 » Tightness problems in the plane |
COLT
2004
Springer
15 years 4 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
In this paper we show how genetic programming can be used to discover useful texture feature extraction algorithms. Grey level histograms of different textures are used as inputs ...
STOC
2003
ACM
15 years 4 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
WSNA
2003
ACM
15 years 4 months ago
2003
ACM
—In a sensor network, data routing is tightly coupled to the needs of a sensing task, and hence the application semantics. This paper introduces the novel idea of information-dir...
112
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....