2095 search results - page 216 / 419 » Improved pebbling bounds |
166
click to vote
EVOW
2007
Springer
16 years 23 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
179
click to vote
VLDB
2007
ACM
16 years 21 days ago
2007
ACM
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...
199
click to vote
GLOBECOM
2006
IEEE
16 years 19 days ago
2006
IEEE
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
159
click to vote
ICCV
2005
IEEE
16 years 6 days ago
2005
IEEE
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
152
click to vote
SIGIR
2005
ACM
16 years 4 days ago
2005
ACM
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...