Sciweavers

1221 search results - page 209 / 245
» Balanced graph partitioning
Sort
View
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
13 years 11 months 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 9 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 9 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
DCOSS
2008
Springer
13 years 9 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
NIPS
2008
13 years 9 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson