Sciweavers

1105 search results - page 144 / 221
» Linear choosability of graphs
Sort
View
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
Sketching Clothoid Splines Using Shortest Paths
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
Ilya Baran, Jaakko Lehtinen, Jovan Popovic
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
15 years 11 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
CIVR
2007
Springer
15 years 11 months ago
Comparison of face matching techniques under pose variation
The ability to match faces in video is a crucial component for many multimedia applications such as searching and recognizing people in semantic video browsing, surveillance and h...
Bart Kroon, Alan Hanjalic, Sabri Boughorbel
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 10 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
ICALP
2010
Springer
15 years 9 months ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan