Sciweavers

169 search results - page 11 / 34
» Reductions among high dimensional proximity problems
Sort
View
WWW
2008
ACM
14 years 8 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...
BMVC
2010
13 years 5 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
ICCS
2007
Springer
14 years 1 months ago
Hessian-Based Model Reduction for Large-Scale Data Assimilation Problems
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
Omar Bashir, Omar Ghattas, Judith Hill, Bart G. va...
CVPR
2004
IEEE
14 years 9 months ago
Inference of Multiple Subspaces from High-Dimensional Data and Application to Multibody Grouping
Multibody grouping is a representative of applying subspace constraints in computer vision tasks. Under linear projection models, feature points of multibody reside in multiple su...
Zhimin Fan, Jie Zhou, Ying Wu
BMCBI
2010
224views more  BMCBI 2010»
13 years 7 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta