501 search results - page 31 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
DCG
2007
13 years 7 months ago
2007
Any finite set X ⊂ Rd colored with d+3 2 colors, contains a rainbow subset Y ⊂ X, such that any ball that contains Y contains a positive fraction of the points of X. The bound...
COMPGEOM
2009
ACM
14 years 8 days ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
TIT
2010
13 years 2 months ago
2010
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representi...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...