649 search results - page 114 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
140
Voted
DAC
2003
ACM
16 years 2 months ago
2003
ACM
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable d...
110
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...
136
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
135
Voted
ESA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...