271 search results - page 38 / 55 » Comparison of two interactive search refinement techniques |
148
Voted
ICITA
2005
IEEE
15 years 9 months ago
2005
IEEE
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
125
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
175
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...
141
click to vote
PRIB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The rapidly emerging field of metagenomics seeks to examine the genomic content of communities of organisms to understand their roles and interactions in an ecosystem. I...
131
Voted
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper we study the computation error tolerance properties of motion estimation algorithms. We are motivated by two scenarios where hardware systems may introduce computati...