Sciweavers

4110 search results - page 458 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
BMCBI
2006
124views more  BMCBI 2006»
15 years 6 months ago
Predicting transcription factor binding sites using local over-representation and comparative genomics
Background: Identifying cis-regulatory elements is crucial to understanding gene expression, which highlights the importance of the computational detection of overrepresented tran...
Matthieu Defrance, Hélène Touzet
DKE
2006
125views more  DKE 2006»
15 years 6 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
IJNSEC
2008
106views more  IJNSEC 2008»
15 years 6 months ago
Parallel Hardware Architectures for the Cryptographic Tate Pairing
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
Guido Marco Bertoni, Luca Breveglieri, Pasqualina ...
CVGIP
2004
169views more  CVGIP 2004»
15 years 6 months ago
Contour interpolation by straight skeletons
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) ...
Gill Barequet, Michael T. Goodrich, Aya Levi-Stein...
JGAA
2000
85views more  JGAA 2000»
15 years 6 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....