Sciweavers

2969 search results - page 126 / 594
» A space efficient algorithm for group structure computation
Sort
View
MPC
1992
Springer
235views Mathematics» more  MPC 1992»
15 years 7 months ago
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
Berry Schoenmakers
CSDA
2006
71views more  CSDA 2006»
15 years 3 months ago
Computation of Huber's M-estimates for a block-angular regression problem
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
Xiao-Wen Chang
BMCBI
2007
142views more  BMCBI 2007»
15 years 3 months ago
SABERTOOTH: protein structural alignment based on a vectorial structure representation
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
Florian Teichert, Ugo Bastolla, Markus Porto
134
Voted
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 7 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
105
Voted
SOFSEM
2009
Springer
16 years 10 days ago
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
We propose a new type of canonical decision diagrams, which allows a more efficient symbolic state-space generation for general asynchronous systems by allowing on-the-fly extensi...
Min Wan, Gianfranco Ciardo