Sciweavers

524 search results - page 91 / 105
» Characterizing the Paralation Model using Dynamic Assignment
Sort
View
GRAPHICSINTERFACE
2008
13 years 9 months ago
Background estimation from non-time sequence images
We address the problem of reconstructing the background of a scene from a set of photographs featuring several occluding objects. We assume that the photographs are obtained from ...
Miguel Granados, Hans-Peter Seidel, Hendrik P. A. ...
ISPASS
2010
IEEE
14 years 2 months ago
Synthesizing memory-level parallelism aware miniature clones for SPEC CPU2006 and ImplantBench workloads
Abstract—We generate and provide miniature synthetic benchmark clones for modern workloads to solve two pre-silicon design challenges, namely: 1) huge simulation time (weeks to m...
Karthik Ganesan, Jungho Jo, Lizy K. John
TC
2010
13 years 5 months ago
The Design and Evaluation of a Self-Organizing Superpeer Network
—Superpeer architectures exploit the heterogeneity of nodes in a peer-to-peer (P2P) network by assigning additional responsibilities to higher capacity nodes. In the design of a ...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
CVPR
2010
IEEE
14 years 3 months ago
Chaotic Invariants of Lagrangian Particle Trajectories for Anomaly Detection in Crowded Scenes
A novel method for crowd flow modeling and anomaly detection is proposed for both coherent and incoherent scenes. The novelty is revealed in three aspects. First, it is a unique ut...
Shandong Wu, Brian E. Moore, and Mubarak Shah
WINE
2009
Springer
184views Economy» more  WINE 2009»
14 years 2 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...