Sciweavers

42738 search results - page 344 / 8548
» Search Computing Systems
Sort
View
104
Voted
CVPR
2008
IEEE
16 years 6 months ago
FuzzyMatte: A computationally efficient scheme for interactive matting
In this paper, we propose an online interactive matting algorithm, which we call FuzzyMatte. Our framework is based on computing the fuzzy connectedness (FC) [20] from each unknow...
Yuanjie Zheng, Chandra Kambhamettu, Jingyi Yu, Tho...
PDP
2006
IEEE
15 years 10 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak
AIM
1998
15 years 4 months ago
Computer Bridge - A Big Win for AI Planning
A computer program that uses AI planning techniques is now the world’s best program for the game of contract bridge. As reported in The New York Times and The Washington Post, t...
Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
164
Voted
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 4 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
HEURISTICS
2008
120views more  HEURISTICS 2008»
15 years 4 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti