Sciweavers

319 search results - page 19 / 64
» Unified Solution to Nonnegative Data Factorization Problems
Sort
View
DCC
2002
IEEE
15 years 9 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
15 years 10 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
ISVC
2009
Springer
15 years 2 months ago
Data Vases:  2D and 3D Plots for Visualizing Multiple Time Series
Abstract. One challenge associated with the visualization of time-dependent data is to develop graphical representations that are effective for exploring multiple time-varying qua...
Sidharth Thakur, Theresa-Marie Rhyne
ICCV
2005
IEEE
15 years 11 months ago
A Graph Cut Algorithm for Generalized Image Deconvolution
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
Ashish Raj, Ramin Zabih
DS
1992
100views Database» more  DS 1992»
14 years 10 months ago
Object Identification in Multidatabase Systems
In the Pegasus prototype multidatabase system, the key to the problem of object identity is a differentiation between the view of a data administrator, capturing all the underlyin...
William Kent, Rafi Ahmed, Joseph Albert, Mohammad ...