Sciweavers

6315 search results - page 385 / 1263
» Approximating Solution Structure
Sort
View
204
Voted
ECCV
2006
Springer
15 years 11 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang
ICASSP
2009
IEEE
15 years 5 months ago
Ensembles of landmark multidimensional scalings
Landmark multidimensional scaling (LMDS) uses a subset of data (landmark points) to solve classical MDS, where the scalability is increased but the approximation is noise-sensitiv...
Seunghak Lee, Seungjin Choi
CVPR
2006
IEEE
16 years 9 months ago
Structure and View Estimation for Tomographic Reconstruction: A Bayesian Approach
This paper addresses the problem of reconstructing the density of a scene from multiple projection images produced by modalities such as x-ray, electron microscopy, etc. where an ...
Satya P. Mallick, Sameer Agarwal, David J. Kriegma...
EDBT
2000
ACM
15 years 12 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
197
Voted
AMAI
1999
Springer
15 years 7 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen