Sciweavers

5316 search results - page 980 / 1064
» Which Search Problems Are Random
Sort
View
241
Voted
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 4 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
159
Voted
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
16 years 3 months ago
A cross-collection mixture model for comparative text mining
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
ChengXiang Zhai, Atulya Velivelli, Bei Yu
220
Voted
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
16 years 3 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
143
Voted
CEC
2009
IEEE
15 years 10 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben
ICCV
2007
IEEE
15 years 9 months ago
Fast Automatic Heart Chamber Segmentation from 3D CT Data Using Marginal Space Learning and Steerable Features
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
Yefeng Zheng, Adrian Barbu, Bogdan Georgescu, Mich...