2520 search results - page 305 / 504 » The complexity of approximating entropy |
163
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
169
click to vote
NCA
2009
IEEE
16 years 1 months ago
2009
IEEE
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
258
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
150
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
155
click to vote
RECSYS
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...