Sciweavers

356 search results - page 28 / 72
» Revisiting the Paxos Algorithm
Sort
View
CPM
2007
Springer
185views Combinatorics» more  CPM 2007»
14 years 1 months ago
Algorithms for Computing the Longest Parameterized Common Subsequence
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos ...
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm...
GECCO
2006
Springer
129views Optimization» more  GECCO 2006»
13 years 11 months ago
Use of statistical outlier detection method in adaptive evolutionary algorithms
In this paper, the issue of adapting probabilities for Evolutionary Algorithm (EA) search operators is revisited. A framework is devised for distinguishing between measurements of...
James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker
IWANN
2001
Springer
13 years 12 months ago
Pattern Repulsion Revisited
Marques and Almeida [9] recently proposed a nonlinear data seperation technique based on the maximum entropy principle of Bell and Sejnowsky. The idea behind is a pattern repulsion...
Fabian J. Theis, Christoph Bauer, Carlos Garc&iacu...
PR
2010
135views more  PR 2010»
13 years 2 months ago
Revisiting priority queues for image analysis
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
Cris L. Luengo Hendriks
ICDE
2012
IEEE
196views Database» more  ICDE 2012»
11 years 9 months ago
Scalable Multi-query Optimization for SPARQL
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
Wangchao Le, Anastasios Kementsietsidis, Songyun D...