Sciweavers

10054 search results - page 211 / 2011
» On the Complexity of Function Learning
Sort
View
141
Voted
MM
2003
ACM
239views Multimedia» more  MM 2003»
15 years 6 months ago
Foreground object detection from videos containing complex background
This paper proposes a novel method for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and undergoes bot...
Liyuan Li, Weimin Huang, Irene Y. H. Gu, Qi Tian
88
Voted
ICIP
2003
IEEE
16 years 2 months ago
PDE-based denoising of complex scenes using a spatially-varying fidelity term
The widely used denoising algorithms based on nonlinear diffusion, such as Perona-Malik and total variation denoising, modify images toward piecewise constant functions. Though ed...
Guy Gilboa, Yehoshua Y. Zeevi, Nir A. Sochen
117
Voted
FOCS
2002
IEEE
15 years 5 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
88
Voted
IPPS
2000
IEEE
15 years 5 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 4 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge