Sciweavers

3005 search results - page 576 / 601
» Computational geometry for sculpture
Sort
View
SPAA
2005
ACM
14 years 2 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
APGV
2004
ACM
145views Visualization» more  APGV 2004»
14 years 2 months ago
Conveying three-dimensional shape with texture
Studies have shown that although shading can give an image a ”natural” look and is an important shape cue, visual perception of surface shape from shading only is severely lim...
Sunghee Kim, Haleh Hagh-Shenas, Victoria Interrant...
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
EGH
2004
Springer
14 years 2 months ago
A programmable vertex shader with fixed-point SIMD datapath for low power wireless applications
The real time 3D graphics becomes one of the attractive applications for 3G wireless terminals although their battery lifetime and memory bandwidth limit the system resources for ...
Ju-Ho Sohn, Ramchan Woo, Hoi-Jun Yoo
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...