Sciweavers

7133 search results - page 358 / 1427
» Communication algorithms with advice
Sort
View
TOG
2012
206views Communications» more  TOG 2012»
13 years 9 months ago
Beady: interactive beadwork design and construction
We introduce the interactive system “Beady” to assist the design and construction of customized 3D beadwork. The user first creates a polygonal mesh model called the design m...
Yuki Igarashi, Takeo Igarashi, Jun Mitani
TOG
2012
246views Communications» more  TOG 2012»
13 years 9 months ago
Continuous penalty forces
We present a simple algorithm to compute continuous penalty forces to determine collision response between rigid and deformable models bounded by triangle meshes. Our algorithm co...
Min Tang, Dinesh Manocha, Miguel A. Otaduy, Ruofen...
TOG
2012
212views Communications» more  TOG 2012»
13 years 9 months ago
Understanding and improving the realism of image composites
Compositing is one of the most commonly performed operations in computer graphics. A realistic composite requires adjusting the appearance of the foreground and background so that...
Su Xue, Aseem Agarwala, Julie Dorsey, Holly E. Rus...
SIGMETRICS
2012
ACM
247views Hardware» more  SIGMETRICS 2012»
13 years 9 months ago
A scalable architecture for maintaining packet latency measurements
Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing)....
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
MOBICOM
2006
ACM
16 years 21 days ago
Localization in sparse networks using sweeps
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
David Kiyoshi Goldenberg, Pascal Bihler, Yang Rich...