752 search results - page 89 / 151 » Faster approximation algorithms for the minimum latency prob... |
133
click to vote
PERCOM
2010
ACM
15 years 1 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
136
click to vote
ICCAD
2008
IEEE
16 years 7 days ago
2008
IEEE
Abstract— Power consumption has become a crucial problem in modern circuit design. Multiple Supply Voltage (MSV) design is introduced to provide higher flexibility in controllin...
130
Voted
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
152
Voted
TEC
2008
15 years 2 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
106
Voted
ESANN
2000
15 years 4 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...