Sciweavers

2512 search results - page 271 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 5 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
CNL
2009
15 years 5 months ago
Controlled English Ontology-Based Data Access
Abstract. As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness....
Camilo Thorne, Diego Calvanese
ISORC
2000
IEEE
15 years 8 months ago
Establishing a Data-Mining Environment for Wartime Event Prediction with an Object-Oriented Command and Control Database
This paper documents progress to date on a research project, the goal of which is wartime event prediction. The paper describes the operational concept, the datamining environment...
Marion G. Ceruti, S. Joe McCarthy
169
Voted
JMLR
2008
148views more  JMLR 2008»
15 years 4 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
ECCV
2008
Springer
16 years 6 months ago
Multiple Component Learning for Object Detection
Abstract. Object detection is one of the key problems in computer vision. In the last decade, discriminative learning approaches have proven effective in detecting rigid objects, a...
Boris Babenko, Pietro Perona, Piotr Dollár,...