Sciweavers

3055 search results - page 118 / 611
» Randomized Search Trees
Sort
View
CEC
2005
IEEE
14 years 4 months ago
Geometric landscape of homologous crossover for syntactic trees
The relationship between search space, distances and genetic operators for syntactic trees is little understood. Geometric crossover and geometric mutation are representation-indep...
Alberto Moraglio, Riccardo Poli
AHSWN
2008
92views more  AHSWN 2008»
13 years 10 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
DEXA
1999
Springer
181views Database» more  DEXA 1999»
14 years 2 months ago
Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases
In this paper, a new indexing technique to support the query evaluation in document databases is proposed. The key idea of the method is the combination of the technique of pat-tre...
Yangjun Chen, Karl Aberer
CVPR
2006
IEEE
15 years 12 days ago
The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
John M. Winn, Jamie Shotton
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
14 years 2 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert