Sciweavers

2376 search results - page 270 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
ICDM
2009
IEEE
188views Data Mining» more  ICDM 2009»
13 years 7 months ago
Binomial Matrix Factorization for Discrete Collaborative Filtering
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
Jinlong Wu
ICIAR
2010
Springer
13 years 7 months ago
Image Segmentation for Robots: Fast Self-adapting Gaussian Mixture Model
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
Nicola Greggio, Alexandre Bernardino, José ...
CAP
2010
13 years 4 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
ESA
2008
Springer
95views Algorithms» more  ESA 2008»
13 years 11 months ago
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
IJCAI
2001
13 years 11 months ago
Total-Order Planning with Partially Ordered Subtasks
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
Dana S. Nau, Héctor Muñoz-Avila, Yue...