2168 search results - page 191 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
233
Voted
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
194
Voted
IPSN
2010
Springer
16 years 1 months ago
2010
Springer
We present Virtual High-resolution Time (VHT), a powerproportional time-keeping service that offers a baseline power draw of a low-speed clock (e.g. 32 kHz crystal), but provides...
158
Voted
DAC
1997
ACM
15 years 11 months ago
1997
ACM
CAD tools and research in the area of reduced-order modeling of largelinearinterconnect networkshaveevolved from merely finding a Pad´e approximation for the given network trans...
171
Voted
IJCAI
1997
15 years 8 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
214
click to vote
TSP
2008
15 years 7 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...