Sciweavers

1489 search results - page 170 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
PR
2006
108views more  PR 2006»
14 years 10 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 1 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
CVPR
2010
IEEE
15 years 1 months ago
Bundled Depth-Map Merging for Multi-View Stereo
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
Jianguo Li
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
15 years 10 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
EUROSYS
2007
ACM
15 years 7 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek