Sciweavers

163 search results - page 15 / 33
» Fast Edge-Routing for Large Graphs
Sort
View
KONVENS
2000
13 years 11 months ago
The RWTH Large Vocabulary Speech Recognition System for Spontaneous Speech
This paper presents details of the RWTH large vocabulary continuous speech recognition system used in the VERBMOBIL spontaneous speech translation system. In particular, we report...
Stephan Kanthak, Sirko Molau, Achim Sixtus, Ralf S...
COMAD
2009
13 years 8 months ago
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are...
Kiran Kate, Balaraman Ravindran
ATVA
2006
Springer
191views Hardware» more  ATVA 2006»
13 years 11 months ago
Automatic Verification of Hybrid Systems with Large Discrete State Space
We address the problem of model checking hybrid systems which exhibit nontrivial discrete behavior and thus cannot be treated by considering the discrete states one by one, as most...
Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang,...
HT
2009
ACM
14 years 2 months ago
The scalable hyperlink store
This paper describes the Scalable Hyperlink Store, a distributed in-memory “database” for storing large portions of the web graph. SHS is an enabler for research on structural...
Marc Najork
CVPR
2004
IEEE
14 years 9 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell