2985 search results - page 111 / 597 » Indexing Distributed Complex Data for Complex Queries |
143
Voted
BNCOD
2003
15 years 6 months ago
2003
In this paper we describe a query paradigm based on ontologies, aggregate table-driven querying and expansion of QBE. It has two novel features: visually specifying aggregate table...
147
click to vote
JMLR
2006
15 years 4 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
140
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Boosting methods are known not to usually overfit training data even as the size of the generated classifiers becomes large. Schapire et al. attempted to explain this phenomenon i...
153
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
139
click to vote
JITECH
2010
15 years 3 months ago
2010
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...