Sciweavers

13603 search results - page 2485 / 2721
» On the Complexity of Computing Treelength
Sort
View
CGF
2004
86views more  CGF 2004»
15 years 7 months ago
Procedural Texture Matching and Transformation
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
Eric Bourque, Gregory Dudek
CLUSTER
2004
IEEE
15 years 7 months ago
Resource Management for Ad-Hoc Wireless Networks with Cluster Organization
Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. G...
Ionut Cardei, Srivatsan Varadarajan, Allalaghatta ...
PODC
2009
ACM
16 years 7 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
16 years 25 days ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
CVPR
2009
IEEE
17 years 2 months ago
Dense 3D Motion Capture for Human Faces
This paper proposes a novel approach to motion capture from multiple, synchronized video streams, specifically aimed at recording dense and accurate models of the structure and ...
Yasutaka Furukawa (University of Washington), Jean...
« Prev « First page 2485 / 2721 Last » Next »