Sciweavers

52 search results - page 8 / 11
» Improved Deletions in Dynamic Spatial Approximation Trees
Sort
View
ICDE
2004
IEEE
99views Database» more  ICDE 2004»
15 years 11 months ago
Direct Mesh: a Multiresolution Approach to Terrain Visualization
Terrain can be approximated by a triangular mesh consisting millions of 3D points. Multiresolution triangular mesh (MTM) structures are designed to support applications that use t...
Kai Xu 0003, Xiaofang Zhou, Xuemin Lin
93
Voted
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 4 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 9 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 6 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ATAL
2009
Springer
15 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...