Sciweavers

2107 search results - page 276 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
116
Voted
TKDE
2008
134views more  TKDE 2008»
15 years 2 months ago
Contraflow Transportation Network Reconfiguration for Evacuation Route Planning
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...
Sangho Kim, Shashi Shekhar, Manki Min
122
Voted
CVPR
2010
IEEE
15 years 10 months ago
Learning Shift-Invariant Sparse Representation of Actions
A central problem in the analysis of motion capture (Mo- Cap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should fac...
Yi Li
108
Voted
CCCG
2009
15 years 3 months ago
Optimal Empty Pseudo-Triangles in a Point Set
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher
107
Voted
ICCD
2001
IEEE
154views Hardware» more  ICCD 2001»
15 years 11 months ago
Performance Optimization By Wire and Buffer Sizing Under The Transmission Line Model
As the operating frequency increases to Giga Hertz and the rise time of a signal is less than or comparable to the time-of-flight delay of a line, it is necessary to consider the...
Tai-Chen Chen, Song-Ra Pan, Yao-Wen Chang
129
Voted
CIKM
2004
Springer
15 years 8 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel