1871 search results - page 80 / 375 » The Ephemeral Pairing Problem |
117
click to vote
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
PODS
2006
ACM
15 years 11 months ago
2006
ACM
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
CVPR
2001
IEEE
16 years 1 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
117
click to vote
ICML
2001
IEEE
16 years 18 hour ago
2001
IEEE
In this paper, we show how we can learn to select good words for a document title. We view the problem of selecting good title words for a document as a variant of an Information ...