1083 search results - page 90 / 217 » Efficient Discovery of Confounders in Large Data Sets |
165
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
175
click to vote
DEXA
2008
Springer
15 years 8 months ago
2008
Springer
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
197
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
152
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Discriminative training of graphical models can be expensive if the variables have large cardinality, even if the graphical structure is tractable. In such cases, pseudolikelihood...
187
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We address the problem of segmenting 3D scan data into objects or object classes. Our segmentation framework is based on a subclass of Markov Random Fields (MRFs) which support ef...