Sciweavers

8437 search results - page 676 / 1688
» Preferences over Sets
Sort
View
ALT
1998
Springer
15 years 11 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
PRICAI
1998
Springer
15 years 11 months ago
Point-Based Approaches to Qualitative Temporal Reasoning
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
Tim Van Allen, James P. Delgrande, Arvind Gupta
ANTS
1998
Springer
93views Algorithms» more  ANTS 1998»
15 years 11 months ago
Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space
We prove that to find a nontrivial integer linear relation between vectors of a lattice L IRn , whose euclidean length is at most M, one needs O n5+ (ln Mn/)1+ binary operations f...
Igor A. Semaev
VLDB
1992
ACM
109views Database» more  VLDB 1992»
15 years 11 months ago
On B-Tree Indices for Skewed Distributions
It is often the case that the set of values over which a B-Tree is constructed has a skewed distribution. We present a geometric growth technique to manage postings records in suc...
Christos Faloutsos, H. V. Jagadish
163
Voted
CIE
2007
Springer
15 years 11 months ago
Effective Computation for Nonlinear Systems
Nonlinear dynamical and control systems are an important source of applications for theories of computation over the the real numbers, since these systems are usually to complicate...
Pieter Collins