Sciweavers

4744 search results - page 237 / 949
» Connected Computing
Sort
View
CGF
2002
127views more  CGF 2002»
15 years 3 months ago
Angle-Analyzer: A Triangle-Quad Mesh Codec
We present Angle-Analyzer, a new single-rate compression algorithm for triangle-quad hybrid meshes. Using a carefully-designed geometry-driven mesh traversal and an efficient enco...
Haeyoung Lee, Pierre Alliez, Mathieu Desbrun
WEA
2010
Springer
245views Algorithms» more  WEA 2010»
15 years 10 months ago
Contraction of Timetable Networks with Realistic Transfers
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
Robert Geisberger
ICIP
1997
IEEE
16 years 5 months ago
Complexity-Regularized Image Denoising
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Juan Liu, Pierre Moulin
SAINT
2005
IEEE
15 years 9 months ago
The Simplicity Project: Architecture Concept
The research community is working towards a new allencompassing vision of the Internet. This vision certainly includes powerful transport and switching technologies, wireless netw...
Nicola Blefari-Melazzi, Wolfgang Kellerer, Chie No...
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
15 years 7 months ago
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
Rafail Ostrovsky