Sciweavers

74 search results - page 11 / 15
» Smallest Color-Spanning Objects
Sort
View
DAC
2005
ACM
14 years 8 months ago
Race-condition-aware clock skew scheduling
The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling can achieve. Therefore, the combination of clock skew scheduling and dela...
Shih-Hsu Huang, Yow-Tyng Nieh, Feng-Pin Lu
PKDD
2009
Springer
138views Data Mining» more  PKDD 2009»
14 years 1 months ago
Margin and Radius Based Multiple Kernel Learning
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
Huyen Do, Alexandros Kalousis, Adam Woznica, Melan...
ACSAC
2008
IEEE
14 years 1 months ago
The Role Hierarchy Mining Problem: Discovery of Optimal Role Hierarchies
Role hierarchies are fundamental to the role based access control (RBAC) model. The notion of role hierarchy is a well understood concept that allows senior roles to inherit the p...
Qi Guo, Jaideep Vaidya, Vijayalakshmi Atluri
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
14 years 1 months ago
A graph theoretic approach to optimal target tracking for mobile robot teams
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
Jason C. Derenick, John R. Spletzer, M. Ani Hsieh
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
14 years 1 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand