844 search results - page 106 / 169 » Solving the p |
164
click to vote
CRYPTO
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
149
click to vote
ICASSP
2008
IEEE
16 years 11 days ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
165
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
176
click to vote
TCS
2010
15 years 4 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
204
click to vote
IDA
2011
Springer
15 years 27 days ago
2011
Springer
Ubiquitous Knowledge Discovery is a new research area at the intersection of machine learning and data mining with mobile and distributed systems. In this paper the main character...