Sciweavers

11160 search results - page 72 / 2232
» Incompleteness in a General Setting
Sort
View
PODC
1999
ACM
15 years 7 months ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
DAS
2008
Springer
15 years 4 months ago
Towards Whole-Book Recognition
We describe experimental results for unsupervised recognition of the textual contents of book-images using fully automatic mutual-entropy-based model adaptation. Each experiment s...
Pingping Xiu, Henry S. Baird
COMPGEOM
2007
ACM
15 years 7 months ago
An optimal generalization of the centerpoint theorem, and its extensions
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Saurabh Ray, Nabil H. Mustafa
CCCG
2008
15 years 4 months ago
On distinct distances among points in general position and other related problems
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vector...
Adrian Dumitrescu
DAM
2007
67views more  DAM 2007»
15 years 3 months ago
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
Gustav Nordh