Sciweavers

447 search results - page 19 / 90
» Re-ranking search results using document-passage graphs
Sort
View
QSHINE
2005
IEEE
14 years 9 days ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
EVOW
2008
Springer
13 years 8 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
DAGM
2004
Springer
14 years 4 days ago
Pixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...
Daniel Keysers, Thomas Deselaers, Hermann Ney
CP
2003
Springer
13 years 12 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
ECP
1997
Springer
103views Robotics» more  ECP 1997»
13 years 11 months ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler