Sciweavers

1096 search results - page 54 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
ICDM
2006
IEEE
147views Data Mining» more  ICDM 2006»
15 years 5 months ago
Adaptive Parallel Graph Mining for CMP Architectures
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...
Gregory Buehrer, Srinivasan Parthasarathy, Yen-Kua...
JAIR
2006
101views more  JAIR 2006»
14 years 11 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee
NJC
2000
99views more  NJC 2000»
14 years 11 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
BTW
1999
Springer
157views Database» more  BTW 1999»
15 years 4 months ago
Database Primitives for Spatial Data Mining
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Stefan Grundlach, Hans-Peter Kriegel...
ICDE
2012
IEEE
202views Database» more  ICDE 2012»
13 years 2 months ago
Recomputing Materialized Instances after Changes to Mappings and Data
—A major challenge faced by today’s information systems is that of evolution as data usage evolves or new data resources become available. Modern organizations sometimes exchan...
Todd J. Green, Zachary G. Ives