Sciweavers

1298 search results - page 122 / 260
» The online set cover problem
Sort
View
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
15 years 8 months ago
Creating a Cluster Hierarchy under Constraints of a Partially Known Hierarchy
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
Korinna Bade, Andreas Nürnberger
TPDS
2008
122views more  TPDS 2008»
15 years 6 months ago
Nonmigratory Multiprocessor Scheduling for Response Time and Energy
Energy usage has been an important concern in recent research on online job scheduling, where processors are allowed to vary the speed dynamically so as to save energy whenever pos...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
SIGIR
2012
ACM
13 years 9 months ago
Language intent models for inferring user browsing behavior
Modeling user browsing behavior is an active research area with tangible real-world applications, e.g., organizations can adapt their online presence to their visitors browsing be...
Manos Tsagkias, Roi Blanco
ICCV
2007
IEEE
16 years 8 months ago
Learning priors for calibrating families of stereo cameras
Online camera recalibration is necessary for long-term deployment of computer vision systems. Existing algorithms assume that the source of recalibration information is a set of f...
Andrew W. Fitzgibbon, Duncan P. Robertson, Antonio...
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 10 months ago
Graph Coloring with Rejection
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger