Sciweavers

552 search results - page 89 / 111
» On the Complexity of Join Predicates
Sort
View
PEWASUN
2005
ACM
14 years 1 months ago
Application of synchronous dynamic encryption system (SDES) in wireless sensor networks
Inherent to the wireless sensor networks are the two major problems of the broadcasting vulnerability, the limited computational capability and power budget. Even though security ...
Hamdy S. Soliman, Mohammed Omari
DAWAK
2005
Springer
14 years 1 months ago
Efficient Compression of Text Attributes of Data Warehouse Dimensions
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
Jorge Vieira, Jorge Bernardino, Henrique Madeira
GCC
2005
Springer
14 years 1 months ago
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying ...
Habib Rostami, Jafar Habibi
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 1 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
COMPGEOM
2004
ACM
14 years 1 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...