Sciweavers

4372 search results - page 154 / 875
» Algorithmic Theories of Everything
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 10 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
PODS
2012
ACM
240views Database» more  PODS 2012»
11 years 11 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
14 years 3 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
ISAAC
2009
Springer
93views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Computing Multidimensional Persistence
Abstract. The theory of multidimensional persistence captures the topology of a multifiltration – a multiparameter family of increasing spaces. Multifiltrations arise naturally...
Gunnar Carlsson, Gurjeet Singh, Afra Zomorodian
CADE
1999
Springer
14 years 1 months ago
A dynamic programming approach to categorial deduction
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
Philippe de Groote