Sciweavers

58 search results - page 6 / 12
» On distinct distances among points in general position and o...
Sort
View
ICAPR
2001
Springer
13 years 11 months ago
Grouping via the Matching of Repeated Patterns
Abstract. In this contribution, a novel and robust, geometry-based grouping strategy is proposed. Repeated, planar patterns in special relative positions are detected. The grouping...
Andreas Turina, Tinne Tuytelaars, Theo Moons, Luc ...
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 8 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
NDJFL
2010
13 years 2 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen
MP
2010
126views more  MP 2010»
13 years 5 months ago
Two row mixed-integer cuts via lifting
Recently, Andersen et al. [1], Borozan and Cornu´ejols [7] and Cornu´ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...
Santanu S. Dey, Laurence A. Wolsey
GD
1998
Springer
13 years 11 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner