Sciweavers

794 search results - page 50 / 159
» Improved algorithms for orienteering and related problems
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 9 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
MMDB
2003
ACM
94views Multimedia» more  MMDB 2003»
14 years 2 months ago
Improving image retrieval effectiveness via multiple queries
Conventional approaches to image retrieval are based on the assumption that relevant images are physically near the query image in some feature space. This is the basis of the clu...
Xiangyu Jin, James C. French
IJCAI
1989
13 years 10 months ago
Training Feedforward Neural Networks Using Genetic Algorithms
Multilayered feedforward neural networks possess a number of properties which make them particularly suited to complex pattern classification problems. However, their application ...
David J. Montana, Lawrence Davis
JIPS
2006
129views more  JIPS 2006»
13 years 9 months ago
ASVMRT: Materialized View Selection Algorithm in Data Warehouse
: In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view select...
Jin-Hyuk Yang, In-Jeong Chung
ICRA
2005
IEEE
117views Robotics» more  ICRA 2005»
14 years 2 months ago
CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
Yoav Gabriely, Elon Rimon