2168 search results - page 231 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
125
Voted
ACL
2011
14 years 8 months ago
2011
We learn a joint model of sentence extraction and compression for multi-document summarization. Our model scores candidate summaries according to a combined linear model whose fea...
159
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
127
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
148
Voted
DCOSS
2011
Springer
14 years 4 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
115
click to vote
ICCAD
2002
IEEE
16 years 1 months ago
2002
IEEE
- The new concept of Multi-node Moment Matching (MMM) is introduced in this paper. The MMM technique simultaneously matches the moments at several nodes of a circuit using explicit...