Sciweavers

715 search results - page 79 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
14 years 1 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
PODC
2012
ACM
11 years 11 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
JDWM
2010
180views more  JDWM 2010»
13 years 7 months ago
Investigating the Properties of a Social Bookmarking and Tagging Network
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
Ralitsa Angelova, Marek Lipczak, Evangelos E. Mili...
AI
2002
Springer
13 years 8 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
ISMIR
2001
Springer
108views Music» more  ISMIR 2001»
14 years 1 months ago
Thematic Extractor
We have created a system that identifies musical keywords or themes. The system searches for all patterns composed of melodic (intervallic for our purposes) repetition in a piece....
Colin Meek