Sciweavers

235 search results - page 9 / 47
» Online Embeddings
Sort
View
PERCOM
2006
ACM
15 years 11 months ago
Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
Evangelos Kranakis, Tim Mott, Ladislav Stacho
FOCS
1995
IEEE
15 years 3 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
EMSOFT
2010
Springer
14 years 9 months ago
Energy-aware packet and task co-scheduling for embedded systems
A crucial objective in battery operated embedded systems is to work under the minimal power consumption that provides a desired level of performance. Dynamic Voltage Scaling (DVS)...
Luca Santinelli, Mauro Marinoni, Francesco Prosper...
ECRTS
2006
IEEE
15 years 5 months ago
Optimal On-Line Scheduling of Multiple Control Tasks: A Case Study
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
Anton Cervin, Peter Alriksson
BIOID
2008
101views Biometrics» more  BIOID 2008»
15 years 1 months ago
Template Protection for On-Line Signature-Based Recognition Systems
Abstract. Security and privacy issues are considered as two of the major concerns related to the use of biometric data for authentication purposes. In this paper we propose two dif...
Emanuele Maiorana, Patrizio Campisi, Alessandro Ne...