9842 search results - page 1427 / 1969 » The Complexity of the Matching-Cut Problem |
270
click to vote
COMPGEOM
2010
ACM
16 years 5 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
205
click to vote
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
182
click to vote
SODA
1992
ACM
15 years 8 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
178
click to vote
COCO
2003
Springer
16 years 10 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
223
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
We propose a scheme for indoor place identi cation based on the recognition of global scene
views. Scene views are encoded using a holistic representation that provides low-resolu...