3221 search results - page 331 / 645 » Termination of Linear Programs |
198
Voted
ACMSE
2010
ACM
15 years 1 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
172
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
—Both the communication limitation and the measurement properties based algorithm become the bottleneck of enhancing the traditional power system state estimation speed. The avai...
182
click to vote
APLAS
2005
ACM
16 years 6 days ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
229
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
158
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...