Sciweavers

20197 search results - page 3706 / 4040
» Comparing Computational Power
Sort
View
NPAR
2010
ACM
15 years 9 months ago
Detail-preserving paint modeling for 3D brushes
Recent years have witnessed significant advances in 3D brush modeling and simulation in digital paint tools. Compared with traditional 2D brushes, a 3D brush can be both more intu...
Nelson Siu-Hang Chu, William Baxter, Li-Yi Wei, Na...
ICARCV
2002
IEEE
166views Robotics» more  ICARCV 2002»
15 years 9 months ago
Similarity measure determination from NURBS-warping method
With the advances in digital imagery, large accessible data storage, internet repositories, and image applications, information conveyed through images is gaining in importance. T...
Kim Meng Liang, Mandava Rajeswari, Bee Ee Khoo
133
Voted
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
15 years 8 months ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal
SPAA
2010
ACM
15 years 8 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
162
Voted
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 8 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
« Prev « First page 3706 / 4040 Last » Next »