Sciweavers

879 search results - page 129 / 176
» Designing Closer to the Edge
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 9 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
ICDE
2010
IEEE
271views Database» more  ICDE 2010»
14 years 8 months ago
Preference Queries in Large Multi-Cost Transportation Networks
Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, howev...
Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu
EUROGRAPHICS
2010
Eurographics
14 years 6 months ago
Isosurfaces Over Simplicial Partitions of Multiresolution Grids
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
Josiah Manson and Scott Schaefer
ICCAD
2004
IEEE
87views Hardware» more  ICCAD 2004»
14 years 5 months ago
Exploiting level sensitive latches in wire pipelining
Wire pipelining emerges as a new necessity for global wires due to increasing wire delay, shrinking clock period and growing chip size. Existing approaches on wire pipelining are ...
V. Seth, Min Zhao, Jiang Hu
CSE
2009
IEEE
14 years 3 months ago
Information Flow and Search in Unstructured Keyword Based Social Networks
—In online social networks (OSNs), user connections can be represented as a network. The network formed has distinct properties that distinguish it from other network topologies....
Ankush Garg, Prantik Bhattacharyya, Charles U. Mar...