Sciweavers

16404 search results - page 298 / 3281
» A set coverage problem
Sort
View
FOCS
1993
IEEE
15 years 8 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
FLAIRS
2008
15 years 7 months ago
Reasoning about Topological and Positional Information in Dynamic Settings
Typical application fields of spatial and spatio-temporal representation formalisms and reasoning techniques include geographic information systems (GIS), mobile assistance system...
Marco Ragni, Stefan Wölfl
DMIN
2006
115views Data Mining» more  DMIN 2006»
15 years 6 months ago
Privacy Preserving in Clustering using Fuzzy Sets
Data mining techniques, in spite of their benefit in a wide range of applications have also raised threat to privacy and data security. This paper addresses the problem of preservi...
S. Srinivasa Rao 0002, K. V. S. V. N. Raju, P. Kus...
JMLR
2008
104views more  JMLR 2008»
15 years 4 months ago
Learning Reliable Classifiers From Small or Incomplete Data Sets: The Naive Credal Classifier 2
In this paper, the naive credal classifier, which is a set-valued counterpart of naive Bayes, is extended to a general and flexible treatment of incomplete data, yielding a new cl...
Giorgio Corani, Marco Zaffalon
BSL
2000
153views more  BSL 2000»
15 years 4 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon