Sciweavers

1199 search results - page 47 / 240
» Graph Theory
Sort
View
117
Voted
CONCUR
2003
Springer
15 years 7 months ago
A Compositional Semantic Theory for Synchronous Component-based Design
Abstract. Digital signal processing and control (DSPC) tools allow application developers to assemble systems by connecting predefined components in signal–flow graphs and by h...
Barry Norton, Gerald Lüttgen, Michael Mendler
148
Voted
NIPS
2004
15 years 4 months ago
Co-Training and Expansion: Towards Bridging Theory and Practice
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
Maria-Florina Balcan, Avrim Blum, Ke Yang
138
Voted
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
15 years 3 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
116
Voted
TON
2010
141views more  TON 2010»
15 years 1 months ago
Weighted spectral distribution for internet topology analysis: theory and applications
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew...
123
Voted
ICPP
2006
IEEE
15 years 8 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri