Sciweavers

1284 search results - page 211 / 257
» Data Structures for Mergeable Trees
Sort
View
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
14 years 11 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson
CADE
2010
Springer
14 years 11 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
ML
2008
ACM
100views Machine Learning» more  ML 2008»
14 years 10 months ago
Generalized ordering-search for learning directed probabilistic logical models
Abstract. Recently, there has been an increasing interest in directed probabilistic logical models and a variety of languages for describing such models has been proposed. Although...
Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendri...
TCS
2008
14 years 9 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
TOG
2008
88views more  TOG 2008»
14 years 9 months ago
Interaction patches for multi-character animation
We propose a data-driven approach to automatically generate a scene where tens to hundreds of characters densely interact with each other. During off-line processing, the close in...
Hubert P. H. Shum, Taku Komura, Masashi Shiraishi,...