Sciweavers

1983 search results - page 292 / 397
» Competitive graph searches
Sort
View
AIRWEB
2007
Springer
14 years 1 months ago
Measuring Similarity to Detect Qualified Links
The early success of link-based ranking algorithms was predicated on the assumption that links imply merit of the target pages. However, today many links exist for purposes other ...
Xiaoguang Qi, Lan Nie, Brian D. Davison
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
14 years 22 days ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
MVA
2007
137views Computer Vision» more  MVA 2007»
13 years 10 months ago
Fingerprint Core and Delta Detection by Candidate Analysis
This paper presents a new reliable detection of core and delta in fingerprints by candidate analysis. The line search based method, which is one of the reliable approaches to dete...
Tomohiko Ohtsuka, Daisuke Watanabe, Hiroyuki Aoki
ML
2000
ACM
150views Machine Learning» more  ML 2000»
13 years 8 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
AI
1999
Springer
13 years 8 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter