Sciweavers

7289 search results - page 1370 / 1458
» A Dependent Set Theory
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
SIGMOD
2007
ACM
198views Database» more  SIGMOD 2007»
14 years 8 months ago
Addressing diverse user preferences in SQL-query-result navigation
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
Zhiyuan Chen, Tao Li
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
14 years 8 months ago
Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
14 years 8 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
PODS
2008
ACM
128views Database» more  PODS 2008»
14 years 8 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
« Prev « First page 1370 / 1458 Last » Next »