980 search results - page 108 / 196 » Faster Possibility Detection by Combining Two Approaches |
206
click to vote
JACM
2011
14 years 9 months ago
2011
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
173
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
181
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
151
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract—Buffer resizing and buffer insertion are two transformation techniques for the performance optimization of elastic systems. Different approaches for each technique have ...
171
click to vote
IADIS
2004
15 years 7 months ago
2004
Distributed management of user profiles and identities allow reuse of profile information for different personalization services but also raises privacy issues. Users need a possi...