Sciweavers

2740 search results - page 152 / 548
» Approximating Component Selection
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 2 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
AIPS
2006
15 years 4 months ago
Solving Factored MDPs with Exponential-Family Transition Models
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
ICML
2007
IEEE
16 years 3 months ago
Infinite mixtures of trees
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...
Sergey Kirshner, Padhraic Smyth
IEEEPACT
2002
IEEE
15 years 8 months ago
Predicting Conditional Branches With Fusion-Based Hybrid Predictors
Researchers have studied hybrid branch predictors that leverage the strengths of multiple stand-alone predictors. The common theme among the proposed techniques is a selection mec...
Gabriel H. Loh, Dana S. Henry
SIGOPSE
1998
ACM
15 years 7 months ago
MMLite: a highly componentized system architecture
MMLite is a modular system architecture that is suitable for a wide variety of hardware and applications. The system provides a selection of object-based components that are dynam...
Johannes Helander, Alessandro Forin