Sciweavers

7751 search results - page 1458 / 1551
» Data streams: algorithms and applications
Sort
View
110
Voted
ICDM
2007
IEEE
197views Data Mining» more  ICDM 2007»
15 years 7 months ago
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
Ruoming Jin, Scott McCallen, Eivind Almaas
ICDM
2006
IEEE
166views Data Mining» more  ICDM 2006»
15 years 6 months ago
Mining Generalized Graph Patterns Based on User Examples
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
Pavel Dmitriev, Carl Lagoze
CF
2010
ACM
15 years 5 months ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross
BALT
2006
15 years 4 months ago
Introducing Softness into Inductive Queries on String Databases
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Ieva Mitasiunaite, Jean-François Boulicaut
110
Voted
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
15 years 2 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
« Prev « First page 1458 / 1551 Last » Next »