Sciweavers

2950 search results - page 561 / 590
» Computing with Infinitely Many Processes
Sort
View
GIS
2006
ACM
14 years 9 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
WWW
2004
ACM
14 years 9 months ago
ResEval: a web-based evaluation system for internal medicine house staff
The evaluation and assessment of physicians-in-training (house staff) is a complex task. Residency training programs are under increasing pressure [1] to provide accurate and comp...
Henry J. Feldman, Marc M. Triola
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 9 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
14 years 9 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...