Sciweavers

1332 search results - page 50 / 267
» An Efficient Algorithm for the Approximate Median Selection ...
Sort
View
SOCO
2010
Springer
13 years 3 months ago
Using evolution strategies to solve DEC-POMDP problems
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
Baris Eker, H. Levent Akin
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 10 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 22 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
TVLSI
2010
13 years 3 months ago
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
Kanad Basu, Prabhat Mishra
ICML
2007
IEEE
14 years 9 months ago
Kernelizing PLS, degrees of freedom, and efficient model selection
Kernelizing partial least squares (PLS), an algorithm which has been particularly popular in chemometrics, leads to kernel PLS which has several interesting properties, including ...
Mikio L. Braun, Nicole Krämer