Sciweavers

3894 search results - page 198 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ISAAC
2005
Springer
100views Algorithms» more  ISAAC 2005»
16 years 21 hour ago
Separability with Outliers
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
Sariel Har-Peled, Vladlen Koltun
IPPS
2002
IEEE
15 years 11 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
CDC
2008
IEEE
16 years 1 months ago
A monotonic algorithm for the optimal control of the Fokker-Planck equation
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...
Guillaume Carlier, Julien Salomon
CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
15 years 10 months ago
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park,...
ATAL
2004
Springer
15 years 12 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...