Sciweavers

450 search results - page 50 / 90
» The Complexity of Computing Minimal Unidirectional Covering ...
Sort
View
VLDB
2005
ACM
86views Database» more  VLDB 2005»
15 years 5 months ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Panagiotis Karras, Nikos Mamoulis
COLING
2000
15 years 1 months ago
Estimation of Stochastic Attribute-Value Grammars using an Informative Sample
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
Miles Osborne
MOR
2006
95views more  MOR 2006»
14 years 11 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ISMB
2000
15 years 1 months ago
Analysis of Gene Expression Microarrays for Phenotype Classification
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...
Andrea Califano, Gustavo Stolovitzky, Yuhai Tu
CVPR
2005
IEEE
16 years 1 months ago
Dense Photometric Stereo Using a Mirror Sphere and Graph Cut
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
Tai-Pang Wu, Chi-Keung Tang