Sciweavers

14850 search results - page 73 / 2970
» A Geometric Approach to Betweenness
Sort
View
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 9 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
GD
1994
Springer
14 years 1 months ago
A Geometrical Heuristic for Drawing Concept Lattices
Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should re ect th...
Gerd Stumme, Rudolf Wille
IPMI
2007
Springer
14 years 9 months ago
Geometrically Proper Models in Statistical Training
In deformable model segmentation, the geometric training process plays a crucial role in providing shape statistical priors and appearance statistics that are used as likelihoods. ...
Qiong Han, Derek Merck, Josh Levy, Christina Villa...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 9 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
SIROCCO
2001
13 years 10 months ago
Competitive Online Routing in Geometric Graphs
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
Prosenjit Bose, Pat Morin