Sciweavers

5022 search results - page 815 / 1005
» Data structures and problem solving using Java
Sort
View
115
Voted
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 5 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
JMLR
2010
149views more  JMLR 2010»
14 years 5 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel
SJ
2010
136views more  SJ 2010»
14 years 5 months ago
Optimizing the Migration to Future-Generation Passive Optical Networks (PON)
We study the upgrading problem of existing Passive Optical Networks (PONs) that need to increase their capacity at different points in time. Our method upgrades line rates and migr...
M. De Andrade, Massimo Tornatore, S. Sallent, Bisw...
ICASSP
2011
IEEE
14 years 1 months ago
Eigentriphones: A basis for context-dependent acoustic modeling
In context-dependent acoustic modeling, it is important to strike a balance between detailed modeling and data sufficiency for robust estimation of model parameters. In the past,...
Tom Ko, Brian Mak
CVPR
2007
IEEE
16 years 7 days ago
Efficiently Determining Silhouette Consistency
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
Li Yi, David W. Jacobs