Sciweavers

2260 search results - page 397 / 452
» A new algorithm for clustering search results
Sort
View
ICALP
2005
Springer
15 years 11 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
PCI
2005
Springer
15 years 11 months ago
Closest Pair Queries with Spatial Constraints
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
EMO
2009
Springer
181views Optimization» more  EMO 2009»
15 years 10 months ago
Multi-Objective Particle Swarm Optimizers: An Experimental Comparison
Particle Swarm Optimization (PSO) has received increased attention in the optimization research community since its first appearance. Regarding multi-objective optimization, a con...
Juan José Durillo, José Garcí...
ILP
1998
Springer
15 years 10 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia
FSTTCS
2006
Springer
15 years 9 months ago
Multi-stack Boundary Labeling Problems
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...