Sciweavers

252 search results - page 40 / 51
» Automata for Data Words and Data Trees
Sort
View
PC
2011
413views Management» more  PC 2011»
13 years 2 months ago
Exploiting thread-level parallelism in the iterative solution of sparse linear systems
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...
José Ignacio Aliaga, Matthias Bollhöfe...
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
14 years 8 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
JUCS
2006
104views more  JUCS 2006»
13 years 7 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
ICALP
2005
Springer
14 years 1 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...