Sciweavers

1190 search results - page 147 / 238
» On the Structure of Syntenic Distance
Sort
View
STOC
2003
ACM
126views Algorithms» more  STOC 2003»
14 years 9 months ago
A new approach to dynamic all pairs shortest paths
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
Camil Demetrescu, Giuseppe F. Italiano
SIGMOD
2004
ACM
128views Database» more  SIGMOD 2004»
14 years 9 months ago
A TeXQuery-Based XML Full-Text Search Engine
We demonstrate an XML full-text search engine that implements the TeXQuery language. TeXQuery is a powerful fulltext search extension to XQuery that provides a rich set of fully c...
Chavdar Botev, Jayavel Shanmugasundaram, Sihem Ame...
DCC
2008
IEEE
14 years 8 months ago
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...
Sumanta Sarkar, Subhamoy Maitra
LICS
2009
IEEE
14 years 3 months ago
Statistic Analysis for Probabilistic Processes
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
Michel de Rougemont, Mathieu Tracol
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 3 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...