Sciweavers

274 search results - page 48 / 55
» Computational complexity of queries based on itemsets
Sort
View
FOCS
2004
IEEE
15 years 4 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
93
Voted
FLAIRS
2004
15 years 1 months ago
Splitting Ratios: Metric Details of Topological Line-Line Relations
Within the geographic domain, an important class of relies on geometric abstractions in the form of lines where, for instance, transportation networks and trajectories of movement...
Konstantinos A. Nedas, Max J. Egenhofer
JCM
2006
112views more  JCM 2006»
15 years 11 days ago
A Peer-to-Peer Cooperation Enhancement Scheme and its Performance Analysis
The performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that user...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...
101
Voted
ML
2008
ACM
15 years 11 days ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer
AWIC
2003
Springer
15 years 5 months ago
From Search Engines to Question-Answering Systems - The Need for New Tools
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
Lotfi A. Zadeh