Sciweavers

2969 search results - page 48 / 594
» A space efficient algorithm for group structure computation
Sort
View
DEBS
2009
ACM
15 years 7 months ago
MICS: an efficient content space representation model for publish/subscribe systems
One of the main challenges faced by content-based publish/subscribe systems is handling large amount of dynamic subscriptions and publications in a multidimensional content space....
Hojjat Jafarpour, Sharad Mehrotra, Nalini Venkatas...
BIOCOMP
2006
15 years 4 months ago
PAC: Progressive Alignment with Consensus Sequences
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
Ke Liu, Mansur H. Samadzadeh
COMPGEOM
2005
ACM
15 years 5 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
SIGPRO
2008
89views more  SIGPRO 2008»
15 years 3 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
15 years 7 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi