Sciweavers

4541 search results - page 264 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
120
Voted
WWW
2006
ACM
16 years 4 months ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
144
Voted
JMLR
2010
144views more  JMLR 2010»
14 years 10 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
104
Voted
COMGEO
2010
ACM
15 years 3 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
156
Voted
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
15 years 9 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
149
Voted
MICCAI
2007
Springer
15 years 9 months ago
Robust Autonomous Model Learning from 2D and 3D Data Sets
In this paper we propose a weakly supervised learning algorithm for appearance models based on the minimum description length (MDL) principle. From a set of training images or volu...
Georg Langs, Rene Donner, Philipp Peloschek, Horst...