Sciweavers

575 search results - page 53 / 115
» A Note on Karr's Algorithm
Sort
View
SIAMJO
2008
76views more  SIAMJO 2008»
14 years 11 months ago
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn, we consider the problem of reducing the input set for the computation of the minimum enclosing ball of A. In this note, given an approximate soluti...
S. Damla Ahipasaoglu, E. Alper Yildirim
TIP
2008
146views more  TIP 2008»
14 years 11 months ago
Image Modeling Using Interscale Phase Properties of Complex Wavelet Coefficients
This paper describes an approach to image modelling using interscale phase relationships of wavelet coefficients for use in image estimation applications. The method is based on th...
Mark Miller, Nick G. Kingsbury
ICA
2012
Springer
13 years 6 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
RANDOM
1998
Springer
15 years 3 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
15 years 11 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger