Sciweavers

13336 search results - page 2608 / 2668
» Computer Vision: Algorithms and Applications
Sort
View
145
Voted
SPAA
2004
ACM
15 years 8 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
ACISP
2004
Springer
15 years 8 months ago
On Security of XTR Public Key Cryptosystems Against Side Channel Attacks
The XTR public key system was introduced at Crypto 2000. Application of XTR in cryptographic protocols leads to substantial savings both in communication and computational overhead...
Dong-Guk Han, Jongin Lim, Kouichi Sakurai
151
Voted
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 8 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...
151
Voted
COMPGEOM
2003
ACM
15 years 8 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
137
Voted
SI3D
2003
ACM
15 years 8 months ago
Opacity light fields: interactive rendering of surface light fields with view-dependent opacity
We present new hardware-accelerated techniques for rendering surface light fields with opacity hulls that allow for interactive visualization of objects that have complex reflec...
Daniel Vlasic, Hanspeter Pfister, Sergey Molinov, ...
« Prev « First page 2608 / 2668 Last » Next »