8437 search results - page 119 / 1688 » Preferences over Sets |
174
click to vote
PKDD
2007
Springer
16 years 12 days ago
2007
Springer
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
169
click to vote
FUIN
2010
15 years 3 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
177
click to vote
TPDS
1998
15 years 6 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
158
click to vote
FFA
2006
15 years 6 months ago
2006
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
184
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Given a set P of products, a set O of customers, and a product p P, a bichromatic reverse skyline query retrieves all the customers in O that do not find any other product in P t...