Sciweavers

3652 search results - page 299 / 731
» A study of query length
Sort
View
124
Voted
COCOON
2006
Springer
15 years 7 months ago
The Complexity of Black-Box Ring Problems
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
128
Voted
DAGM
2006
Springer
15 years 7 months ago
Efficient Algorithms for Similarity Measures over Sequential Data: A Look Beyond Kernels
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance fu...
Konrad Rieck, Pavel Laskov, Klaus-Robert Müll...
148
Voted
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
15 years 3 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
120
Voted
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
15 years 3 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld
JCB
2006
124views more  JCB 2006»
15 years 3 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque