Sciweavers

2693 search results - page 44 / 539
» On Computing Complex Navigation Functions
Sort
View
LICS
2008
IEEE
14 years 4 months ago
The Ordinal Recursive Complexity of Lossy Channel Systems
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
Pierre Chambart, Ph. Schnoebelen
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
ACCV
2006
Springer
14 years 3 months ago
Waterfall Segmentation of Complex Scenes
Abstract. We present an image segmentation technique using the morphological Waterfall algorithm. Improvements in the segmentation are brought about by using improved gradients. Th...
Allan Hanbury, Beatriz Marcotegui
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 11 months ago
Navigation- vs. Index-Based XML Multi-Query Processing
XML path queries form the basis of complex filtering of XML data. Most current XML path query processing techniques can be divided in two groups. Navigation-based algorithms compu...
Nicolas Bruno, Luis Gravano, Nick Koudas, Divesh S...
LOGCOM
2007
92views more  LOGCOM 2007»
13 years 9 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley