Sciweavers

3663 search results - page 608 / 733
» Problems in the ontology of computer programs
Sort
View
ICIP
1995
IEEE
15 years 11 months ago
Constrained monotone regression of ROC curves and histograms using splines and polynomials
Receiver operating characteristics (ROC) curves have the property that they start at (0,l) and end at (1,O) and are monotonically decreasing. Furthermore, a parametric representat...
Tapas Kanungo, D. M. Gay, Robert M. Haralick
VIS
2004
IEEE
178views Visualization» more  VIS 2004»
15 years 11 months ago
Depth Enhanced Panoramas
Depth enhanced panoramas are a practical solution to the difficult problem of inside-looking-out modeling. Depth enhanced panoramas extend color panoramas to support viewpoint tra...
Gleb Bahmutov, Voicu Popescu, Elisha Sacks
ICML
2009
IEEE
15 years 10 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
ICML
2007
IEEE
15 years 10 months ago
Maximum margin clustering made practical
Maximum margin clustering (MMC) is a recent large margin unsupervised learning approach that has often outperformed conventional clustering methods. Computationally, it involves n...
Kai Zhang, Ivor W. Tsang, James T. Kwok
CAV
2009
Springer
134views Hardware» more  CAV 2009»
15 years 10 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...