Sciweavers

244 search results - page 41 / 49
» Balanced Cayley graphs and balanced planar graphs
Sort
View
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
14 years 25 days ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
FOCS
2000
IEEE
14 years 20 days ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
14 years 19 days ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
BIRD
2008
Springer
158views Bioinformatics» more  BIRD 2008»
13 years 11 months ago
A Computational Method for Reconstructing Gapless Metabolic Networks
Abstract. We propose a computational method for reconstructing metabolic networks. The method utilizes optimization techniques and graph traversal algorithms to discover a set of b...
Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko ...
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
13 years 11 months ago
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
Wei Chen, Chi Wang, Yajun Wang