Sciweavers

87 search results - page 12 / 18
» Random Selection with an Adversarial Majority
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
11 years 9 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
DKE
2006
122views more  DKE 2006»
13 years 7 months ago
Sampling, information extraction and summarisation of Hidden Web databases
Hidden Web databases maintain a collection of specialised documents, which are dynamically generated in response to users' queries. The majority of these documents are genera...
Yih-Ling Hedley, Muhammad Younas, Anne E. James, M...
JMLR
2011
111views more  JMLR 2011»
13 years 2 months ago
Models of Cooperative Teaching and Learning
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
Sandra Zilles, Steffen Lange, Robert Holte, Martin...