Sciweavers

1017 search results - page 162 / 204
» A General Model for Authenticated Data Structures
Sort
View
CADE
2008
Springer
14 years 9 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 9 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
CODES
2006
IEEE
14 years 2 months ago
The pipeline decomposition tree: : an analysis tool for multiprocessor implementation of image processing applications
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...
Dong-Ik Ko, Shuvra S. Bhattacharyya
MIR
2006
ACM
141views Multimedia» more  MIR 2006»
14 years 2 months ago
Mining temporal patterns of movement for video content classification
Scalable approaches to video content classification are limited by an inability to automatically generate representations of events ode abstract temporal structure. This paper pre...
Michael Fleischman, Philip DeCamp, Deb Roy
VRST
2006
ACM
14 years 2 months ago
P2P Network for very large virtual environment
The ever increasing speed of Internet connections has led to a point where it is actually possible for every end user to seamlessly share data on Internet. Peer-To-Peer (P2P) netw...
Romain Cavagna, Christian Bouville, Jér&oci...