2944 search results - page 362 / 589 » Improving Bound Propagation |
152
click to vote
COLT
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
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 22 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 20 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...