Sciweavers

131 search results - page 14 / 27
» On the Maximum Number of Translates in a Point Set
Sort
View
COMPGEOM
2009
ACM
14 years 5 days ago
Kinetic spanners in Rd
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
Mohammad Ali Abam, Mark de Berg
DAM
1999
88views more  DAM 1999»
13 years 7 months ago
Separable Partitions
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
Noga Alon, Shmuel Onn
SWAT
2004
Springer
103views Algorithms» more  SWAT 2004»
14 years 25 days ago
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
Mark de Berg, Sergio Cabello, Panos Giannopoulos, ...
MOBIHOC
2006
ACM
14 years 7 months ago
Energy conservation via domatic partitions
Using a dominating set as a coordinator in wireless networks has been proposed in many papers as an energy conservation technique. Since the nodes in a dominating set have the ext...
Sriram V. Pemmaraju, Imran A. Pirwani
ACL
2009
13 years 5 months ago
A Beam-Search Extraction Algorithm for Comparable Data
This paper extends previous work on extracting parallel sentence pairs from comparable data (Munteanu and Marcu, 2005). For a given source sentence S, a maximum entropy (ME) class...
Christoph Tillmann