Sciweavers

1209 search results - page 208 / 242
» Approximation by pseudo-linear operators
Sort
View
190
Voted
INFORMS
1998
150views more  INFORMS 1998»
15 years 5 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
COMGEO
1999
ACM
15 years 5 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
SIGMETRICS
2002
ACM
104views Hardware» more  SIGMETRICS 2002»
15 years 5 months ago
Improving cluster availability using workstation validation
We demonstrate a framework for improving the availability of cluster based Internet services. Our approach models Internet services as a collection of interconnected components, e...
Taliver Heath, Richard P. Martin, Thu D. Nguyen
SIAMJO
2010
246views more  SIAMJO 2010»
15 years 4 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
TKDE
2010
148views more  TKDE 2010»
15 years 4 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang