Sciweavers

41 search results - page 4 / 9
» Shortest Descending Paths through Given Faces
Sort
View
IV
2002
IEEE
109views Visualization» more  IV 2002»
13 years 10 months ago
FaceSpace: A Facial Spatial-Domain Toolkit
We will describe a visual development system for exploring face space, both in terms of facial types and animated expressions. Imagine an n-dimensional space describing every huma...
Steve DiPaola
BROADNETS
2004
IEEE
13 years 9 months ago
Random Asynchronous Wakeup Protocol for Sensor Networks
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
Vamsi Paruchuri, Shivakumar Basavaraju, Arjan Durr...
INFOCOM
2007
IEEE
14 years 2 days ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford
MASCOTS
2004
13 years 7 months ago
Routing in an Internet-Scale Network Emulator
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...
Jay Chen, Diwaker Gupta, Kashi Venkatesh Vishwanat...
CAD
2004
Springer
13 years 5 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...