Sciweavers

8699 search results - page 196 / 1740
» Elements of the Theory of Computation
Sort
View
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 8 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
CAMP
2005
IEEE
16 years 5 days ago
Bio-Inspired Computing Architectures: The Embryonics Approach
Abstract— The promise of next-generation computer technologies, such as nano-electronics, implies a number of serious alterations to the design flow of digital circuits. One of ...
Gianluca Tempesti, Daniel Mange, André Stau...
FCCM
1998
IEEE
113views VLSI» more  FCCM 1998»
15 years 10 months ago
PAM-Blox: High Performance FPGA Design for Adaptive Computing
PAM-Blox are object-oriented circuit generators on top of the PCI Pamette design environment, PamDC. High- performance FPGA design for adaptive computing is simplified by using a ...
Oskar Mencer, Martin Morf, Michael J. Flynn
TKDE
2010
151views more  TKDE 2010»
15 years 4 months ago
Duplicate-Insensitive Order Statistics Computation over Data Streams
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsur...
ICCV
2005
IEEE
16 years 8 months ago
A Theory of Refractive and Specular 3D Shape by Light-Path Triangulation
We investigate the feasibility of reconstructing an arbitrarily-shaped specular scene (refractive or mirror-like) from one or more viewpoints. By reducing shape recovery to the pr...
Kiriakos N. Kutulakos, Eron Steger