Sciweavers

4372 search results - page 153 / 875
» Algorithmic Theories of Everything
Sort
View
CORR
2008
Springer
157views Education» more  CORR 2008»
13 years 9 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko
CVPR
2003
IEEE
14 years 11 months ago
Perception-based 3D Triangle Mesh Segmentation Using Fast Marching Watersheds
In this paper, we describe an algorithm called Fast Marching Watersheds that segments a triangle mesh into visual parts. This computer vision algorithm leverages a human vision th...
David L. Page, Andreas Koschan, Mongi A. Abidi
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 9 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
RECSYS
2009
ACM
14 years 3 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
AAAI
2008
13 years 11 months ago
Bounding the False Discovery Rate in Local Bayesian Network Learning
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
Ioannis Tsamardinos, Laura E. Brown