Sciweavers

2714 search results - page 326 / 543
» Approximation Schemes for Scheduling
Sort
View
INFOCOM
2000
IEEE
15 years 8 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
133
Voted
CGI
1998
IEEE
15 years 8 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
COMPSAC
2004
IEEE
15 years 7 months ago
On the Complexity of Finding Emerging Patterns
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...
Lusheng Wang, Hao Zhao, Guozhu Dong, Jianping Li
160
Voted
AAAI
2010
15 years 5 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 5 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...