Sciweavers

6769 search results - page 1201 / 1354
» A new concept of robustness
Sort
View
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 10 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
CADE
2005
Springer
14 years 10 months ago
Privacy-Sensitive Information Flow with JML
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...
Guillaume Dufay, Amy P. Felty, Stan Matwin
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
14 years 10 months ago
Finding k-dominant skylines in high dimensional space
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a ...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 10 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
« Prev « First page 1201 / 1354 Last » Next »