Sciweavers

10988 search results - page 1923 / 2198
» Algorithmic Folding Complexity
Sort
View
CONEXT
2008
ACM
15 years 5 months ago
MINT: a Market for INternet Transit
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
Vytautas Valancius, Nick Feamster, Ramesh Johari, ...
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
15 years 5 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
154
Voted
DAGM
2008
Springer
15 years 5 months ago
Resolution Enhancement of PMD Range Maps
Photonic mixer device (PMD) range cameras are becoming popular as an alternative to algorithmic 3D reconstruction but their main drawbacks are low-resolution (LR) and noise. Recent...
A. N. Rajagopalan, Arnav V. Bhavsar, Frank Wallhof...
DCOSS
2008
Springer
15 years 5 months ago
FIT: A Flexible, LIght-Weight, and Real-Time Scheduling System for Wireless Sensor Platforms
Abstract. We propose FIT, a flexible, light-weight and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hiera...
Wei Dong, Chun Chen, Xue Liu, Kougen Zheng, Rui Ch...
ICA
2007
Springer
15 years 5 months ago
Bayesian Estimation of Overcomplete Independent Feature Subspaces for Natural Images
In this paper, we propose a Bayesian estimation approach to extend independent subspace analysis (ISA) for an overcomplete representation without imposing the orthogonal constraint...
Libo Ma, Liqing Zhang
« Prev « First page 1923 / 2198 Last » Next »