Sciweavers

1983 search results - page 124 / 397
» Competitive graph searches
Sort
View
JMLR
2008
124views more  JMLR 2008»
13 years 8 months ago
Learning Control Knowledge for Forward Search Planning
A number of today's state-of-the-art planners are based on forward state-space search. The impressive performance can be attributed to progress in computing domain independen...
Sung Wook Yoon, Alan Fern, Robert Givan
SIGIR
2008
ACM
13 years 7 months ago
Towards breaking the quality curse.: a web-querying approach to web people search
Searching for people on the Web is one of the most common query types to the web search engines today. However, when a person name is queried, the returned webpages often contain ...
Dmitri V. Kalashnikov, Rabia Nuray-Turan, Sharad M...
ICML
2007
IEEE
14 years 8 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
WEA
2009
Springer
123views Algorithms» more  WEA 2009»
14 years 2 months ago
Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...
Hannes Moser, Rolf Niedermeier, Manuel Sorge
ICIP
2008
IEEE
14 years 2 months ago
Augmented tree partitioning for interactive image segmentation
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
Yangqing Jia, Jingdong Wang, Changshui Zhang, Xian...