Sciweavers

11211 search results - page 1709 / 2243
» Rank-Sensitive Data Structures
Sort
View
CHI
2005
ACM
16 years 6 months ago
prefuse: a toolkit for interactive information visualization
Although information visualization (infovis) technologies have proven indispensable tools for making sense of complex data, wide-spread deployment has yet to take hold, as success...
Jeffrey Heer, Stuart K. Card, James A. Landay
POPL
2004
ACM
16 years 6 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
POPL
2003
ACM
16 years 6 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
CADE
2008
Springer
16 years 6 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»
16 years 6 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
« Prev « First page 1709 / 2243 Last » Next »