Sciweavers

2229 search results - page 339 / 446
» Comparative analysis of biclustering algorithms
Sort
View
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 3 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
BCS
2008
13 years 11 months ago
Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
Arnab Sinha, Sumana Gupta
OPODIS
2003
13 years 11 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 10 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
TKDE
2008
156views more  TKDE 2008»
13 years 10 months ago
A Framework for Mining Sequential Patterns from Spatio-Temporal Event Data Sets
Given a large spatio-temporal database of events, where each event consists of the fields event ID, time, location, and event type, mining spatio-temporal sequential patterns ident...
Yan Huang, Liqin Zhang, Pusheng Zhang