Sciweavers

335 search results - page 25 / 67
» Solving the Hamiltonian path problem with a light-based comp...
Sort
View
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 10 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
14 years 1 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
ICCV
2007
IEEE
14 years 4 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
ICPR
2004
IEEE
14 years 11 months ago
Multi Feature Path Modeling for Video Surveillance
This paper proposes a novel method for detecting nonconforming trajectories of objects as they pass through a scene. Existing methods mostly use spatial features to solve this pro...
Imran N. Junejo, Mubarak Shah, Omar Javed
MOBICOM
2003
ACM
14 years 3 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano