Sciweavers

3652 search results - page 52 / 731
» A study of query length
Sort
View
COCOA
2008
Springer
13 years 9 months ago
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
Gerold Jäger, Paul Molitor
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
Unidirectional Error Correcting Codes for Memory Systems: A Comparative Study
In order to achieve fault tolerance, highly reliable system often require the ability to detect errors as soon as they occur and prevent the speared of erroneous information throu...
Muzhir Al-Ani, Qeethara Al-Shayea
BMCBI
2005
57views more  BMCBI 2005»
13 years 7 months ago
Satellog: A database for the identification and prioritization of satellite repeats in disease association studies
Background: To date, 35 human diseases, some of which also exhibit anticipation, have been associated with unstable repeats. Anticipation has been reported in a number of diseases...
Perseus I. Missirlis, Carri-Lyn R. Mead, Stefanie ...
MM
2006
ACM
168views Multimedia» more  MM 2006»
14 years 1 months ago
Scalability of local image descriptors: a comparative study
Computer vision researchers have recently proposed several local descriptor schemes. Due to lack of database support, however, these descriptors have only been evaluated using sma...
Herwig Lejsek, Friðrik Heiðar Ásmun...
CSR
2006
Springer
13 years 11 months ago
All Semi-local Longest Common Subsequences in Subquadratic Time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
Alexandre Tiskin