Sciweavers

7978 search results - page 75 / 1596
» Combining shared-coin algorithms
Sort
View
WSCG
2004
118views more  WSCG 2004»
15 years 25 days ago
Combining Geometrical and Mechanical Displacements for Suppressing Intersections in Cartographic Generalization
This paper describes a method for suppressing spatial conflicts in cartographic generalization of isobathymetric lines. These lines are modeled by parametric curves. For that purp...
Eric Guilbert, Eric Saux, Marc Daniel
TIT
2008
81views more  TIT 2008»
14 years 11 months ago
Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints
Abstract--In this paper, the Lagrangian formulation of variablerate vector quantization is extended to quantization with simultaneous constraints on entropy and codebook size, incl...
Robert M. Gray, Tamás Linder, John T. Gill ...
COLING
2002
14 years 11 months ago
Combining Unsupervised and Supervised Methods for PP Attachment Disambiguation
Statistical methods for PP attachment fall into two classes according to the training material used: first, unsupervised methods trained on raw text corpora and second, supervised...
Martin Volk
PROPERTYTESTING
2010
14 years 9 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
AIPS
2006
15 years 27 days ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang