21430 search results - page 3774 / 4286 » Abstract Effective Models |
206
click to vote
ADMA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
186
click to vote
ADMI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study the problem of predictive data mining in the competitive multi-agent setting, in which each agent is assumed to have some partial knowledge needed for correctly ...
213
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
192
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
193
click to vote
CANS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...