Sciweavers

2570 search results - page 3 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
EDBT
2011
ACM
281views Database» more  EDBT 2011»
13 years 1 days ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
WALCOM
2008
IEEE
127views Algorithms» more  WALCOM 2008»
13 years 10 months ago
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...
ICIP
2001
IEEE
14 years 10 months ago
A comparative evaluation of algorithms for fast computation of level set PDEs with applications to motion segmentation
We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation al...
Abdol-Reza Mansouri, Thierry Chomaud, Janusz Konra...
IJACTAICIT
2010
127views more  IJACTAICIT 2010»
13 years 5 months ago
New Proposed Algorithms for nth Order Butterworth Active Filter Computer-Aided Design
This paper describes new proposed algorithms for constructing the transfer function of nth order Butterworth LPF using the idea of the cascade combination of active filters. Compu...
Haider Fakher Radhi Al-Saidy