Sciweavers

327 search results - page 30 / 66
» A fully dynamic algorithm for planar
Sort
View
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 3 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
PG
2007
IEEE
14 years 3 months ago
The Soft Shadow Occlusion Camera
A fundamental challenge for existing shadow map based algorithms is dealing with partially illuminated surfaces. A conventional shadow map built with a pinhole camera only determi...
Qi Mo, Voicu Popescu, Chris Wyman
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
14 years 19 days ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
CVPR
2011
IEEE
13 years 4 months ago
Online Detection of Unusual Events in Videos via Dynamic Sparse Coding
Real-time unusual event detection in video stream has been a difficult challenge due to the lack of sufficient training information, volatility of the definitions for both norm...
Bin Zhao, Li Fei-Fei, Eric Xing
DC
2010
13 years 9 months ago
Towards worst-case churn resistant peer-to-peer systems
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer