2031 search results - page 305 / 407 » On Tree-Constrained Matchings and Generalizations |
108
click to vote
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
WSDM
2009
ACM
15 years 4 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
115
click to vote
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Trust plays important roles in diverse decentralized environments, including our society at large. Computational trust models help to, for instance, guide users’ judgements in o...
108
click to vote
CIVR
2009
Springer
15 years 4 months ago
2009
Springer
Many of the successful multimedia retrieval systems focus on developing efficient and effective video retrieval solutions with the help of appropriate index structures. In these ...
RECSYS
2009
ACM
15 years 4 months ago
2009
ACM
Conversation double pivots recommend target items related to a source item, based on co-mentions of source and target items in online forums. We deployed several variants on the d...