Sciweavers

6756 search results - page 1135 / 1352
» The Structure of Visual Spaces
Sort
View
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
16 years 7 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 7 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
KDD
2002
ACM
136views Data Mining» more  KDD 2002»
16 years 7 months ago
Relational Markov models and their application to adaptive web navigation
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
Corin R. Anderson, Pedro Domingos, Daniel S. Weld
VLSID
2003
IEEE
180views VLSI» more  VLSID 2003»
16 years 7 months ago
Automating Formal Modular Verification of Asynchronous Real-Time Embedded Systems
Most verification tools and methodologies such as model checking, equivalence checking, hardware verification, software verification, and hardware-software coverification often fl...
Pao-Ann Hsiung, Shu-Yu Cheng
POPL
2003
ACM
16 years 7 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
« Prev « First page 1135 / 1352 Last » Next »