Sciweavers

1389 search results - page 130 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
JCSS
2008
80views more  JCSS 2008»
15 years 3 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
109
Voted
ATAL
2008
Springer
15 years 5 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis
PODS
2006
ACM
134views Database» more  PODS 2006»
16 years 3 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
AIME
2007
Springer
15 years 9 months ago
Inference in the Promedas Medical Expert System
Abstract. In the current paper, the Promedas model for internal medicine, developed by our team, is introduced. The model is based on up-todate medical knowledge and consists of ap...
Bastian Wemmenhove, Joris M. Mooij, Wim Wiegerinck...
LATIN
1998
Springer
15 years 7 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro