Sciweavers

3657 search results - page 682 / 732
» A Study of Practical Deduplication
Sort
View
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 1 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
AOSD
2007
ACM
15 years 1 months ago
Aspect-oriented application-level scheduling for J2EE servers
Achieving sufficient execution performance is a challenging goal of software development. Unfortunately, violating performance requirements is often revealed at a late stage of th...
Kenichi Kourai, Hideaki Hibino, Shigeru Chiba
ICDT
2010
ACM
180views Database» more  ICDT 2010»
15 years 1 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
DEBS
2007
ACM
15 years 1 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
CIE
2010
Springer
15 years 1 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch