6740 search results - page 463 / 1348 » An s -Hamiltonian Line Graph Problem |
173
click to vote
SIGIR
2006
ACM
16 years 23 days ago
2006
ACM
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
220
click to vote
SPIRE
2005
Springer
16 years 9 days ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
174
click to vote
ICALP
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
202
click to vote
IJSNET
2007
15 years 6 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
204
click to vote
TCSV
2008
15 years 6 months ago
2008
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...