Sciweavers

60 search results - page 6 / 12
» Simple Permutations Mix Well
Sort
View
COLT
2006
Springer
13 years 11 months ago
Stable Transductive Learning
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...
Ran El-Yaniv, Dmitry Pechyony
JEA
2008
97views more  JEA 2008»
13 years 7 months ago
Approximating the true evolutionary distance between two genomes
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
Krister M. Swenson, Mark Marron, Joel V. Earnest-D...
TASLP
2010
138views more  TASLP 2010»
13 years 2 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...
DCC
1998
IEEE
13 years 11 months ago
Compression of Unicode Files
The increasing importance of Unicode for text files, for example with Java and in some modern operating systems, implies a possible doubling of data storage space and data transmi...
Peter M. Fenwick, Simon Brierley
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 11 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...