Sciweavers

2446 search results - page 96 / 490
» Where am I
Sort
View
APPROX
2005
Springer
94views Algorithms» more  APPROX 2005»
14 years 3 months ago
Testing Periodicity
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
Oded Lachish, Ilan Newman
FSTTCS
2005
Springer
14 years 3 months ago
The Set Cover with Pairs Problem
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
Refael Hassin, Danny Segev
CPM
2001
Springer
72views Combinatorics» more  CPM 2001»
14 years 2 months ago
Tandem Cyclic Alignment
We present a solution for the following problem. Given two sequences X = x1x2 · · · xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X = Xk [i] vs Y ove...
Gary Benson
ECIR
2008
Springer
13 years 11 months ago
A Wikipedia-Based Multilingual Retrieval Model
This paper introduces CL-ESA, a new multilingual retrieval model for the analysis of cross-language similarity. The retrieval model exploits the multilingual alignment of Wikipedia...
Martin Potthast, Benno Stein, Maik Anderka
NIPS
2007
13 years 11 months ago
Optimal models of sound localization by barn owls
Sound localization by barn owls is commonly modeled as a matching procedure where localization cues derived from auditory inputs are compared to stored templates. While the matchi...
Brian Fischer