2725 search results - page 545 / 545 » Constraint Solving for Interpolation |
ICDCN
2011
Springer
12 years 11 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
Entities on social systems, such as users on Twitter, and images on Flickr, are at the core of many interesting applications: they can be ranked in search results, recommended to ...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...