Sciweavers

1242 search results - page 92 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
SPAA
2004
ACM
15 years 3 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
PODS
2010
ACM
159views Database» more  PODS 2010»
14 years 11 months ago
On probabilistic fixpoint and Markov chain query languages
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
Daniel Deutch, Christoph Koch, Tova Milo
CVPR
2008
IEEE
16 years 1 days ago
Smoothing-based Optimization
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
Marius Leordeanu, Martial Hebert
EVOW
2010
Springer
15 years 4 months ago
The Problem with Evolutionary Art Is ..
Computational evolutionary art has been an active practice for at least 20 years. Given the remarkable advances in that time in other realms of computing, including other forms of ...
Philip Galanter
PODC
2009
ACM
15 years 10 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher