Sciweavers

1989 search results - page 299 / 398
» Learning to Select Useful Landmarks
Sort
View
TREC
2004
15 years 7 months ago
Juru at TREC 2004: Experiments with Prediction of Query Difficulty
Our experiments in the Robust track this year focused on predicting query difficulty and using this prediction for improving information retrieval. We developed two prediction alg...
Elad Yom-Tov, Shai Fine, David Carmel, Adam Darlow...
SIGCSE
2010
ACM
166views Education» more  SIGCSE 2010»
15 years 6 months ago
Introducing concurrency in CS 1
Because of the growing importance of concurrent programming, many people are trying to figure out where in the curriculum to introduce students to concurrency. In this paper we di...
Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P....
NIPS
2008
15 years 7 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
IJCV
2002
133views more  IJCV 2002»
15 years 5 months ago
Probabilistic Tracking with Exemplars in a Metric Space
Abstract. A new, exemplar-based, probabilistic paradigm for visual tracking is presented. Probabilistic mechanisms are attractive because they handle fusion of information, especia...
Kentaro Toyama, Andrew Blake
WWW
2003
ACM
16 years 6 months ago
Mining topic-specific concepts and definitions on the web
Traditionally, when one wants to learn about a particular topic, one reads a book or a survey paper. With the rapid expansion of the Web, learning in-depth knowledge about a topic...
Bing Liu, Chee Wee Chin, Hwee Tou Ng