Sciweavers

617 search results - page 16 / 124
» Patterns for decoupling data structures and algorithms
Sort
View
CIDM
2007
IEEE
14 years 1 months ago
Structure Prediction in Temporal Networks using Frequent Subgraphs
— There are several types of processes which can be modeled explicitly by recording the interactions between a set of actors over time. In such applications, a common objective i...
Mayank Lahiri, Tanya Y. Berger-Wolf
CIDM
2007
IEEE
13 years 7 months ago
SSM : A Frequent Sequential Data Stream Patterns Miner
Data stream applications like sensor network data, click stream data, have data arriving continuously at high speed rates and require online mining process capable of delivering c...
C. I. Ezeife, Mostafa Monwar
DRM
2007
Springer
14 years 1 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
ICCV
2009
IEEE
15 years 13 days ago
Large Displacement Optical Flow Computation without Warping
We propose an algorithm for large displacement opti- cal flow estimation which does not require the commonly used coarse-to-fine warping strategy. It is based on a quadratic rel...
Frank Steinbrucker, Thomas Pock, Daniel Cremers
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 7 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig