Sciweavers

4486 search results - page 335 / 898
» Adaptable Boundary Sets
Sort
View
SPIESR
2003
136views Database» more  SPIESR 2003»
15 years 9 months ago
Media segmentation using self-similarity decomposition
We present a framework for analyzing the structure of digital media streams. Though our methods work for video, text, and audio, we concentrate on detecting the structure of digit...
Jonathan Foote, Matthew L. Cooper
ACL
1992
15 years 8 months ago
Lattice-Based Word Identification in CLARE
I argue that because of spelling and typing errors and other properties of typed text, the identification of words and word boundaries in general requires syntactic and semantic k...
David M. Carter
187
Voted
ICML
2010
IEEE
15 years 8 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
AUTOMATICA
2008
118views more  AUTOMATICA 2008»
15 years 7 months ago
Optimally switched linear systems
In this paper we address the problem of optimal switching for switched linear systems. The uniqueness of our approach lies in describing the switching action by multiple control i...
Tuhin Das, Ranjan Mukherjee
ADCM
2006
101views more  ADCM 2006»
15 years 7 months ago
A general construction of barycentric coordinates over convex polygons
Barycentric coordinates are unique for triangles, but there are many possible generalizations to convex polygons. In this paper we derive sharp upper and lower bounds on all baryc...
Michael S. Floater, Kai Hormann, Géza K&oac...