Sciweavers

144 search results - page 24 / 29
» Sparsity in time-frequency representations
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
A Variational Approach to the Evolution of Radial Basis Functions for Image Segmentation
In this paper we derive differential equations for evolving radial basis functions (RBFs) to solve segmentation problems. The differential equations result from applying variation...
Greg G. Slabaugh, Huong Quynh Dinh, Gozde B. Unal
ICCV
2005
IEEE
15 years 11 months ago
Sparse Image Coding Using a 3D Non-Negative Tensor Factorization
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the pas...
Tamir Hazan, Simon Polak, Amnon Shashua
COCO
2003
Springer
91views Algorithms» more  COCO 2003»
15 years 3 months ago
Extremal properties of polynomial threshold functions
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
Ryan O'Donnell, Rocco A. Servedio
ESA
2003
Springer
77views Algorithms» more  ESA 2003»
15 years 3 months ago
An Optimal Algorithm for the Maximum-Density Segment Problem
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
Kai-min Chung, Hsueh-I Lu
PLDI
1994
ACM
15 years 1 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali