Sciweavers

1012 search results - page 98 / 203
» Segment intersection searching problems in general settings
Sort
View
ICDT
2003
ACM
202views Database» more  ICDT 2003»
15 years 9 months ago
Condensed Representation of Database Repairs for Consistent Query Answering
Abstract. Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the ...
Jef Wijsen
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
15 years 10 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
MIR
2005
ACM
133views Multimedia» more  MIR 2005»
15 years 10 months ago
Probabilistic web image gathering
We propose a new method for automated large scale gathering of Web images relevant to specified concepts. Our main goal is to build a knowledge base associated with as many conce...
Keiji Yanai, Kobus Barnard
TALG
2010
86views more  TALG 2010»
15 years 2 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
UAI
2004
15 years 5 months ago
"Ideal Parent" Structure Learning for Continuous Variable Networks
In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive proced...
Iftach Nachman, Gal Elidan, Nir Friedman