Sciweavers

281 search results - page 24 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 7 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
CSR
2007
Springer
15 years 3 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
96
Voted
MM
2005
ACM
171views Multimedia» more  MM 2005»
15 years 3 months ago
Semantic manifold learning for image retrieval
Learning the user’s semantics for CBIR involves two different sources of information: the similarity relations entailed by the content-based features, and the relevance relatio...
Yen-Yu Lin, Tyng-Luh Liu, Hwann-Tzong Chen
WADS
2007
Springer
82views Algorithms» more  WADS 2007»
15 years 3 months ago
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michie...
92
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
14 years 11 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta