Sciweavers

210 search results - page 8 / 42
» High Dimensional Similarity Joins: Algorithms and Performanc...
Sort
View
CIKM
2008
Springer
14 years 11 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 2 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
ICCV
2007
IEEE
15 years 11 months ago
3D Variational Brain Tumor Segmentation using a High Dimensional Feature Set
Tumor segmentation from MRI data is an important but time consuming task performed manually by medical experts. Automating this process is challenging due to the high diversity in...
Albert Murtha, Dana Cobzas, Mark Schmidt, Martin J...
MASCOTS
2008
14 years 11 months ago
Finding Good Configurations in High-Dimensional Spaces: Doing More with Less
Manually tuning tens to hundreds of configuration parameters in a complex software system like a database or an application server is an arduous task. Recent work has looked into ...
Risi Thonangi, Vamsidhar Thummala, Shivnath Babu
87
Voted
CIKM
2008
Springer
14 years 11 months ago
Peer-to-peer similarity search over widely distributed document collections
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar d...
Christos Doulkeridis, Kjetil Nørvåg, ...