Sciweavers

2774 search results - page 225 / 555
» Exploiting Deep Structure
Sort
View
DAC
1994
ACM
15 years 10 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
SIGMOD
1991
ACM
81views Database» more  SIGMOD 1991»
15 years 10 months ago
Multi-Disk B-trees
In this paper, Dept. of Computer Science, University of Waterloo Waterloo, Ontario, Canada, N2L 3G1 we consider how to exploit multiple disks to improve the performance of B-tree ...
Bernhard Seeger, Per-Åke Larson
ATVA
2008
Springer
159views Hardware» more  ATVA 2008»
15 years 8 months ago
Component-Based Design and Analysis of Embedded Systems with UPPAAL PORT
UPPAAL PORT is a new tool for component-based design and analysis of embedded systems. It operates on the hierarchically structured continuous time component modeling language Save...
John Håkansson, Jan Carlson, Aurelien Monot,...
AAAI
2010
15 years 8 months ago
Active Inference for Collective Classification
Labeling nodes in a network is an important problem that has seen a growing interest. A number of methods that exploit both local and relational information have been developed fo...
Mustafa Bilgic, Lise Getoor
173
Voted
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
15 years 8 months ago
Intersection in Integer Inverted Indices
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
Peter Sanders, Frederik Transier