Sciweavers

13987 search results - page 502 / 2798
» The Two Guards Problem
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
Approximating Edit Distance Efficiently
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
ICCS
2005
Springer
16 years 17 days ago
Generating Parallel Algorithms for Cluster and Grid Computing
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
Ulisses Kendi Hayashida, Kunio Okuda, Jairo Panett...
ESA
2008
Springer
195views Algorithms» more  ESA 2008»
15 years 8 months ago
A Characterization of 2-Player Mechanisms for Scheduling
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
George Christodoulou, Elias Koutsoupias, Angelina ...
BMCBI
2006
97views more  BMCBI 2006»
15 years 7 months ago
A comparative analysis of the information content in long and short SAGE libraries
Background: Serial Analysis of Gene Expression (SAGE) is a powerful tool to determine gene expression profiles. Two types of SAGE libraries, ShortSAGE and LongSAGE, are classified...
Yi-Ju Li, Puting Xu, Xuejun Qin, Donald E. Schmech...
CORR
2006
Springer
242views Education» more  CORR 2006»
15 years 7 months ago
Matching Edges in Images ; Application to Face Recognition
: This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images...
Joël Le Roux, Philippe Chaurand, Mickael Urru...