Sciweavers

1964 search results - page 41 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
CAD
2008
Springer
13 years 7 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
BMCBI
2005
130views more  BMCBI 2005»
13 years 7 months ago
Some statistical properties of regulatory DNA sequences, and their use in predicting regulatory regions in the Drosophila genome
Background: This paper addresses the problem of recognising DNA cis-regulatory modules which are located far from genes. Experimental procedures for this are slow and costly, and ...
Irina I. Abnizova, Rene te Boekhorst, Klaudia Walt...
CCCG
2003
13 years 9 months ago
Linear Binary Space Partitions and the Hierarchy of Object Classes
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
Petr Tobola, Karel Nechvíle
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
14 years 1 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
CODCRY
2011
Springer
264views Cryptology» more  CODCRY 2011»
12 years 11 months ago
Algorithms for the Shortest and Closest Lattice Vector Problems
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...