Sciweavers

15033 search results - page 172 / 3007
» Complexity Theory and Algorithms
Sort
View
ECAL
1995
Springer
15 years 7 months ago
Elements of a Theory of Simulation
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
Steen Rasmussen, Christopher L. Barrett
NIPS
2007
15 years 5 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
156
Voted
IANDC
2008
122views more  IANDC 2008»
15 years 4 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
175
Voted
COMPGEOM
2005
ACM
15 years 6 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
MOBIHOC
2003
ACM
16 years 3 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger