Sciweavers

4354 search results - page 738 / 871
» Classification-based objective functions
Sort
View
PAMI
2007
125views more  PAMI 2007»
15 years 4 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li
PAMI
2007
118views more  PAMI 2007»
15 years 4 months ago
Learning to Transform Time Series with a Few Examples
We describe a semi-supervised regression algorithm that learns to transform one time series into another time series given examples of the transformation. This algorithm is applie...
Ali Rahimi, Ben Recht, Trevor Darrell
PR
2007
107views more  PR 2007»
15 years 4 months ago
Newtonian clustering: An approach based on molecular dynamics and global optimization
Given a data set, a dynamical procedure is applied to the data points in order to shrink and separate, possibly overlapping clusters. Namely, Newton’s equations of motion are em...
Konstantinos Blekas, Isaac E. Lagaris
PVLDB
2008
132views more  PVLDB 2008»
15 years 4 months ago
Access control over uncertain data
Access control is the problem of regulating access to secret information based on certain context information. In traditional applications, context information is known exactly, p...
Vibhor Rastogi, Dan Suciu, Evan Welbourne
112
Voted
RSA
2008
81views more  RSA 2008»
15 years 4 months ago
Analyzing linear mergers
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
Zeev Dvir, Ran Raz