Sciweavers

621 search results - page 120 / 125
» Estimating Probabilities in Recommendation Systems
Sort
View
COR
2008
122views more  COR 2008»
13 years 9 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
WWW
2004
ACM
14 years 10 months ago
Newsjunkie: providing personalized newsfeeds via analysis of information novelty
We present a principled methodology for filtering news stories by formal measures of information novelty, and show how the techniques can be used to custom-tailor newsfeeds based ...
Evgeniy Gabrilovich, Susan T. Dumais, Eric Horvitz
VRST
2003
ACM
14 years 2 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
CVPR
2010
IEEE
13 years 9 months ago
Total Bregman divergence and its applications to shape retrieval
Shape database search is ubiquitous in the world of biometric systems, CAD systems etc. Shape data in these domains is experiencing an explosive growth and usually requires search...
Meizhu Liu, Baba C. Vemuri, Shun-ichi Amari, Frank...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 9 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...