Sciweavers

86 search results - page 17 / 18
» A Classical Realizability Model for a Semantical Value Restr...
Sort
View
ICDT
2009
ACM
130views Database» more  ICDT 2009»
15 years 10 months ago
Towards a theory of search queries
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management sy...
George H. L. Fletcher, Jan Van den Bussche, Dirk V...
ESOP
2001
Springer
15 years 2 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
COLT
2001
Springer
15 years 2 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
AMAI
2007
Springer
14 years 9 months ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...
CIA
2007
Springer
15 years 3 months ago
Learning Initial Trust Among Interacting Agents
Trust learning is a crucial aspect of information exchange, negotiation, and any other kind of social interaction among autonomous agents in open systems. But most current probabil...
Achim Rettinger, Matthias Nickles, Volker Tresp