2263 search results - page 167 / 453 » On learning in agent-centered search |
176
click to vote
CRYPTO
2005
Springer
16 years 12 hour ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
181
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
158
click to vote
AIPS
2008
15 years 8 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
159
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
158
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Discovering users' specific and implicit geographic intention in web search can greatly help satisfy users' information needs. We build a geo intent analysis system that...