Sciweavers

1887 search results - page 3 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
14 years 5 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
ICML
2009
IEEE
14 years 6 months ago
Partial order embedding with multiple kernels
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
Brian McFee, Gert R. G. Lanckriet
IJCAI
2003
13 years 6 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
BTW
2007
Springer
142views Database» more  BTW 2007»
13 years 11 months ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 6 months ago
An efficient algorithm for partial order production
Gwenaël Joret, J. Ian Munro, Jean Cardinal, R...