9176 search results - page 472 / 1836 » algorithms 2010 |
180
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
181
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
In a social news website people share content they found on the web, called news, then vote for those they like the most. Voting for a news is then considered as a recommendation,...
179
click to vote
CVPR
2010
IEEE
16 years 13 days ago
2010
IEEE
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
165
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
166
click to vote
CC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...