Sciweavers

30 search results - page 4 / 6
» The Complexity of Membership Problems for Circuits Over Sets...
Sort
View
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
14 years 16 days ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 5 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik
KAIS
2008
150views more  KAIS 2008»
13 years 5 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 8 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
MST
2010
140views more  MST 2010»
13 years 4 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh