Sciweavers

1518 search results - page 126 / 304
» Exact and Approximate Bandwidth
Sort
View
CGI
1998
IEEE
15 years 2 months ago
Hierarchical Decomposition of Datasets on Irregular Surface Meshes
In this paper we introduce multiresolution analysis (MRA) algorithmsintendedto be used in scientific visualization,and basedon a non-nestedset ofapproximatingspaces. The need for ...
Georges-Pierre Bonneau, Alexandre Gerussi
93
Voted
COCOA
2008
Springer
15 years 32 min ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
71
Voted
CCCG
2010
14 years 11 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
91
Voted
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
14 years 11 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
NIPS
2003
14 years 11 months ago
Sample Propagation
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
Mark A. Paskin