Sciweavers

11214 search results - page 2062 / 2243
» Just-in-time data structures
Sort
View
JDA
2008
72views more  JDA 2008»
14 years 11 months ago
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, ...
Alexander Tiskin
JDA
2008
84views more  JDA 2008»
14 years 11 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
JIB
2008
87views more  JIB 2008»
14 years 11 months ago
2.5D Visualisation of Overlapping Biological Networks
Biological data is often structured in the form of complex interconnected networks such as protein interaction and metabolic networks. In this paper, we investigate a new problem ...
David Cho Yau Fung, Seok-Hee Hong, Dirk Koschü...
IVC
2006
137views more  IVC 2006»
14 years 11 months ago
An information-theoretic approach to face recognition from face motion manifolds
In this work we consider face recognition from Face Motion Manifolds (FMMs). The use of the Resistor-Average Distance (RAD) as a dissimilarity measure between densities confined t...
Ognjen Arandjelovic, Roberto Cipolla
JMIV
2008
214views more  JMIV 2008»
14 years 11 months ago
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
Tomography is a powerful technique to obtain accurate images of the interior of an object in a nondestructive way. Conventional reconstruction algorithms, such as filtered backproj...
Kees Joost Batenburg
« Prev « First page 2062 / 2243 Last » Next »