Sciweavers

6575 search results - page 1245 / 1315
» Specializing visualization algorithms
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
Propagating Separable Equalities in an MDD Store
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
Tarik Hadzic, John N. Hooker, Peter Tiedemann
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
13 years 9 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
ALENEX
2010
163views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Succinct Trees in Practice
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo N...
SIMUTOOLS
2008
13 years 9 months ago
Simulating SMEPP middleware
Embedded Peer-to-Peer Systems (EP2P) represent a new challenge in the development of software for distributed systems. The main objective of the SMEPP (Secure Middleware for Embed...
Javier Barbarán, Carlos Bonilla, Jose &Aacu...
APCCM
2006
13 years 9 months ago
Network data mining: methods and techniques for discovering deep linkage between attributes
Network Data Mining identifies emergent networks between myriads of individual data items and utilises special algorithms that aid visualisation of `emergent' patterns and tre...
John Galloway, Simeon J. Simoff
« Prev « First page 1245 / 1315 Last » Next »