Sciweavers

5169 search results - page 555 / 1034
» Locality approximation using time
Sort
View
FOCS
1995
IEEE
15 years 10 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
14 years 2 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
TMC
2008
123views more  TMC 2008»
15 years 7 months ago
Learning Adaptive Temporal Radio Maps for Signal-Strength-Based Location Estimation
In wireless networks, a client's locations can be estimated using signal strength received from signal transmitters. Static fingerprint-based techniques are commonly used for ...
Jie Yin, Qiang Yang, Lionel M. Ni
ICVGIP
2008
15 years 8 months ago
Algebraic Splats Representation for Point Based Models
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
Naveen Kumar Bolla, P. J. Narayanan
AAAI
2007
15 years 9 months ago
Learning Large Scale Common Sense Models of Everyday Life
Recent work has shown promise in using large, publicly available, hand-contributed commonsense databases as joint models that can be used to infer human state from day-to-day sens...
William Pentney, Matthai Philipose, Jeff A. Bilmes...