Sciweavers

727 search results - page 80 / 146
» Private approximation of search problems
Sort
View
CIKM
2008
Springer
15 years 2 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
130
Voted
AIPS
2006
15 years 2 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
109
Voted
AI
2008
Springer
15 years 26 days ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
CAISE
2007
Springer
15 years 7 months ago
Personalizing PageRank-Based Ranking over Distributed Collections
In distributed work environments, where users are sharing and searching resources, ensuring an appropriate ranking at remote peers is a key problem. While this issue has been inves...
Stefania Costache, Wolfgang Nejdl, Raluca Paiu
110
Voted
IAT
2010
IEEE
14 years 10 months ago
Collaborative Learning of Ontology Fragments by Co-operating Agents
Abstract--Collaborating agents require either prior agreement on the shared vocabularies that they use for communication, or some means of translating between their private ontolog...
Heather S. Packer, Nicholas Gibbins, Nicholas R. J...