Sciweavers

8437 search results - page 135 / 1688
» Preferences over Sets
Sort
View
JCO
2010
100views more  JCO 2010»
15 years 5 months ago
A class of error-correcting pooling designs over complexes
Abstract As a generalization of de-disjunct matrices and (w,r;d)-cover-freefamilies, the notion of (s,l)e-disjunct matrices is introduced for error-correcting pooling designs over ...
Tayuan Huang, Kaishun Wang, Chih-wen Weng
155
Voted
FFA
2011
104views more  FFA 2011»
15 years 1 months ago
Zeta functions of equivalence relations over finite fields
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...
Tibor Beke
VLDB
2004
ACM
112views Database» more  VLDB 2004»
16 years 7 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SSD
2007
Springer
243views Database» more  SSD 2007»
16 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
194
Voted
MLG
2007
Springer
16 years 1 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens