Sciweavers

3652 search results - page 16 / 731
» A study of query length
Sort
View
IWPEC
2009
Springer
14 years 2 months ago
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
Petr A. Golovach, Dimitrios M. Thilikos
INDOCRYPT
2005
Springer
14 years 1 months ago
Towards Optimal Double-Length Hash Functions
In this paper we design several double length hash functions and study their security properties in the random oracle model. We design a class of double length hash functions (and ...
Mridul Nandi
JIS
2006
96views more  JIS 2006»
13 years 7 months ago
A study of the effect of term proximity on query expansion
Query expansion terms are often used to enhance original query formulations in document retrieval. Such terms are usually selected from the entire documents or from windows or pas...
Olga Vechtomova, Ying Wang
GECCO
2003
Springer
134views Optimization» more  GECCO 2003»
14 years 27 days ago
A Fixed-Length Subset Genetic Algorithm for the p-Median Problem
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
Andrew Lim, Zhou Xu
CCCG
2007
13 years 9 months ago
Terminal Steiner Tree with Bounded Edge Length
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
Zhiyong Lin