Sciweavers

7228 search results - page 73 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl
ICALP
2001
Springer
15 years 2 months ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot
MOC
2010
14 years 4 months ago
Optimization algorithm for reconstructing interface changes of a conductivity inclusion from modal measurements
In this paper, we propose an original optimization approach for reconstructing interface changes of a conductivity inclusion from measurements of eigenvalues and eigenvectors asso...
Habib Ammari, Elena Beretta, Elisa Francini, Hyeon...
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
15 years 10 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
FGR
2004
IEEE
200views Biometrics» more  FGR 2004»
15 years 1 months ago
Using Random Subspace to Combine Multiple Features for Face Recognition
LDA is a popular subspace based face recognition approach. However, it often suffers from the small sample size problem. When dealing with the high dimensional face data, the LDA ...
Xiaogang Wang, Xiaoou Tang