Sciweavers

943 search results - page 129 / 189
» How should data structures and algorithms be taught
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Semi-supervised learning of semantic classes for query understanding: from the web and for the web
Understanding intents from search queries can improve a user’s search experience and boost a site’s advertising profits. Query tagging via statistical sequential labeling mode...
Ye-Yi Wang, Raphael Hoffmann, Xiao Li, Jakub Szyma...
UAI
2008
13 years 10 months ago
Flexible Priors for Exemplar-based Clustering
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
Daniel Tarlow, Richard S. Zemel, Brendan J. Frey
INFOCOM
2011
IEEE
13 years 28 days ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
NIPS
2008
13 years 10 months ago
On the Reliability of Clustering Stability in the Large Sample Regime
Clustering stability is an increasingly popular family of methods for performing model selection in data clustering. The basic idea is that the chosen model should be stable under...
Ohad Shamir, Naftali Tishby
ICCV
2005
IEEE
14 years 2 months ago
Robust Point Matching for Two-Dimensional Nonrigid Shapes
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
Yefeng Zheng, David S. Doermann