Sciweavers

20 search results - page 4 / 4
» Optimal dispersion and central places
Sort
View
PET
2007
Springer
14 years 11 days ago
Anonymity in the Wild: Mixes on Unstructured Networks
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
Shishir Nagaraja
FLAIRS
2004
13 years 7 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
BMCBI
2010
117views more  BMCBI 2010»
13 years 6 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 6 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
ECCV
2010
Springer
13 years 10 months ago
Analyzing Depth from Coded Aperture Sets
Computational depth estimation is a central task in computer vision and graphics. A large variety of strategies have been introduced in the past relying on viewpoint variations, de...