324 search results - page 8 / 65 » Bounds for Functions of Dependent Risks |
74
Voted
DCC
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the m...
COLT
2004
Springer
15 years 1 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
107
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
100
click to vote
LPAR
2001
Springer
15 years 1 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
ACL
2006
14 years 11 months ago
2006
When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural languag...