1083 search results - page 119 / 217 » Efficient Discovery of Confounders in Large Data Sets |
196
click to vote
SOSP
1997
ACM
15 years 7 months ago
1997
ACM
Despite a large research effort, software distributed shared memory systems have not been widely used to run parallel applications across clusters of computers. The higher perform...
144
click to vote
PVLDB
2008
15 years 5 months ago
2008
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
277
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
185
click to vote
UAI
2008
15 years 7 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
185
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
: ? Applying Syntactic Similarity Algorithms for Enterprise Information Management Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph Tucek, Alistair Veitch HP Laborato...