Sciweavers

5606 search results - page 760 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICPR
2004
IEEE
16 years 8 months ago
Pattern Matching by Sequential Subdivision of Transformation Space
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
Mingtian Ni, Stephen E. Reichenbach
ICML
2008
IEEE
16 years 7 months ago
Apprenticeship learning using linear programming
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
Umar Syed, Michael H. Bowling, Robert E. Schapire
RECOMB
2005
Springer
16 years 7 months ago
Avoiding Local Optima in Single Particle Reconstruction
In single-particle reconstruction, a 3D structure is reconstructed from a large number of randomly oriented 2D projections, using techniques related to computed tomography. Unlike ...
Marshall W. Bern, Jindong Chen, Hao Chi Wong
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 7 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
SIGMOD
2005
ACM
128views Database» more  SIGMOD 2005»
16 years 7 months ago
Privacy Preserving OLAP
We present techniques for privacy-preserving computation of multidimensional aggregates on data partitioned across multiple clients. Data from different clients is perturbed (rand...
Rakesh Agrawal, Ramakrishnan Srikant, Dilys Thomas