Sciweavers

557 search results - page 8 / 112
» On the set multi-cover problem in geometric settings
Sort
View
ESA
2009
Springer
115views Algorithms» more  ESA 2009»
14 years 2 months ago
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
JMLR
2007
58views more  JMLR 2007»
13 years 7 months ago
Distances between Data Sets Based on Summary Statistics
The concepts of similarity and distance are crucial in data mining. We consider the problem of defining the distance between two data sets by comparing summary statistics compute...
Nikolaj Tatti
ICRA
2007
IEEE
159views Robotics» more  ICRA 2007»
14 years 2 months ago
Decoupled Visual Servoing from a set of points imaged by an omnidirectional camera
Abstract— This paper presents a hybrid decoupled visionbased control scheme valid for the entire class of central catadioptric sensors (including conventional perspective cameras...
Hicham Hadj-Abdelkader, Youcef Mezouar, Philippe M...
FOCS
1993
IEEE
13 years 11 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
RECOMB
2005
Springer
14 years 8 months ago
Recognition of Binding Patterns Common to a Set of Protein Structures
We present a novel computational method, MultiBind, for recognition of binding patterns common to a set of protein structures. It is the first method which performs a multiple alig...
Maxim Shatsky, Alexandra Shulman-Peleg, Ruth Nussi...