7430 search results - page 274 / 1486 » Programming Applications in CIFF |
119
Voted
LPAR
2001
Springer
15 years 9 months ago
2001
Springer
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
121
click to vote
HPDC
1996
IEEE
15 years 8 months ago
1996
IEEE
The performance of the Global Array shared-memory nonuniform memory-access programming model is explored on the I-WAY, wide-area-network distributed supercomputer environment. The...
139
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
148
click to vote
NIPS
2004
15 years 6 months ago
2004
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
152
click to vote
JAIR
2008
15 years 4 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...