Sciweavers

145 search results - page 5 / 29
» An efficient algorithm for partial order production
Sort
View
CVPR
2009
IEEE
15 years 2 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...
KES
2005
Springer
14 years 27 days ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
AIPS
2007
13 years 9 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...
ICPR
2008
IEEE
14 years 8 months ago
Efficient image inner products applied to active appearance models
This paper introduces a clever way of computing inner products between images in order to drastically reduce the computational complexity of fitting appearance models to images. T...
Jan Erik Solem, Karl Netzell
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 7 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...