Sciweavers

587 search results - page 114 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
ICALP
2001
Springer
14 years 1 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
MOBICOM
2000
ACM
14 years 28 days ago
A scalable location service for geographic ad hoc routing
GLS is a new distributed location service which tracks mobile node locations. GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale ...
Jinyang Li, John Jannotti, Douglas S. J. De Couto,...
PVM
1998
Springer
14 years 23 days ago
SKaMPI: A Detailed, Accurate MPI Benchmark
Abstract. SKaMPI is a benchmark for MPI implementations. Its purpose is the detailed analysis of the runtime of individual MPI operations and comparison of these for di erent imple...
Ralf Reussner, Peter Sanders, Lutz Prechelt, Matth...
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
14 years 21 days ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
CVPR
2010
IEEE
14 years 21 days ago
Stratified Learning of Local Anatomical Context for Lung Nodules in CT Images
The automatic detection of lung nodules attached to other pulmonary structures is a useful yet challenging task in lung CAD systems. In this paper, we propose a stratified statist...
Dijia Wu, Le Lu, Jinbo Bi, Yoshihisa Shinagawa, Ki...