Sciweavers

1664 search results - page 173 / 333
» Distance labeling in graphs
Sort
View
AAAI
2008
15 years 8 months ago
Query-URL Bipartite Based Approach to Personalized Query Recommendation
Query recommendation is considered an effective assistant in enhancing keyword based queries in search engines and Web search software. Conventional approach to query recommendati...
Lin Li, Zhenglu Yang, Ling Liu, Masaru Kitsuregawa
ICPR
2004
IEEE
16 years 7 months ago
Tracking Soccer Players using the Graph Representation
In this project we consider the problem of tracking a soccer player using a static camera. The main goal is to find the position of players in the field at each instance of time t...
Gérard G. Medioni, Isaac Cohen, Neucimar Je...
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 11 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 6 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...