Sciweavers

2623 search results - page 443 / 525
» Universal Learning Theory
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 5 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
113
Voted
KDD
2009
ACM
133views Data Mining» more  KDD 2009»
16 years 1 months ago
On the tradeoff between privacy and utility in data publishing
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...
Tiancheng Li, Ninghui Li
105
Voted
SEMWEB
2001
Springer
15 years 5 months ago
OntoMap - the Guide to the Upper-Level
Abstract. The upper-level ontologies are theories that capture the most common concepts, which are relevant for many of the tasks involving knowledge extraction, representation, an...
Atanas K. Kirakov, Marin Dimitrov
111
Voted
DIS
1999
Springer
15 years 4 months ago
The Melting Pot of Automated Discovery: Principles for a New Science
After two decades of research on automated discovery, many principles are shaping up as a foundation of discovery science. In this paper we view discovery science as automation of ...
Jan M. Zytkow
INFOCOM
2010
IEEE
14 years 10 months ago
Reliable Wireless Broadcasting with Near-Zero Feedback
We examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Our key observation is that, in a broadcast ...
Weiyao Xiao, Sachin Agarwal, David Starobinski, Ar...