Sciweavers

1453 search results - page 251 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Multi-view hair capture using orientation fields
Reconstructing realistic 3D hair geometry is challenging due to omnipresent occlusions, complex discontinuities and specular appearance. To address these challenges, we propose a ...
Linjie Luo, Hao Li, Sylvain Paris, Thibaut Weise, ...
MOBIHOC
2008
ACM
14 years 7 months ago
Delegation forwarding
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
Vijay Erramilli, Mark Crovella, Augustin Chaintrea...
SIGMETRICS
2008
ACM
138views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Utility maximization in peer-to-peer systems
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Ji...
DAC
2009
ACM
14 years 8 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
14 years 4 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...