Sciweavers

3359 search results - page 515 / 672
» A Simplified Idea Algorithm
Sort
View
ECSQARU
2009
Springer
14 years 5 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 4 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ICB
2009
Springer
226views Biometrics» more  ICB 2009»
14 years 4 months ago
Accurate Palmprint Recognition Using Spatial Bags of Local Layered Descriptors
Abstract. State-of-the-art palmprint recognition algorithms achieve high accuracy based on component based texture analysis. However, they are still sensitive to local variations o...
Yufei Han, Tieniu Tan, Zhenan Sun
IDA
2009
Springer
14 years 4 months ago
Estimating Squared-Loss Mutual Information for Independent Component Analysis
Abstract. Accurately evaluating statistical independence among random variables is a key component of Independent Component Analysis (ICA). In this paper, we employ a squared-loss ...
Taiji Suzuki, Masashi Sugiyama
MDM
2009
Springer
121views Communications» more  MDM 2009»
14 years 4 months ago
Lazy-Update B+-Tree for Flash Devices
— With the rapid increasing capacity of flash chips, flash-aware indexing techniques are highly desirable for flash devices. The unique features of flash memory, such as the ...
Sai Tung On, Haibo Hu, Yu Li, Jianliang Xu