Sciweavers

7129 search results - page 1417 / 1426
» Approximation Algorithms for Treewidth
Sort
View
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
INFORMS
1998
100views more  INFORMS 1998»
13 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 7 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
NN
2002
Springer
115views Neural Networks» more  NN 2002»
13 years 7 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
« Prev « First page 1417 / 1426 Last » Next »