577 search results - page 113 / 116 » New interval methods for constrained global optimization |
171
click to vote
ISNN
2011
Springer
14 years 2 months ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
104
click to vote
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We present a new approach for self-calibrating the distortion function and the distortion center of cameras with general radially symmetric distortion. In contrast to mos...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
108
click to vote
CIKM
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...