Sciweavers

2778 search results - page 330 / 556
» Limit complexities revisited
Sort
View
VTC
2006
IEEE
16 years 1 months ago
Proposition of a full deterministic medium access method for wireless network in a robotic application
—Today, many network applications require shorter react time. Robotic field is an excellent example of these needs: robot react time has a direct effect on its task’s complexit...
Adrien van den Bossche, Thierry Val, Eric Campo
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
16 years 1 months ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...
CONEXT
2006
ACM
16 years 1 months ago
Towards a versatile transport protocol
In the context of a reconfigurable transport protocol, this paper introduces two protocol instances based on the composition and specialisation of the TFRC congestion control and...
Guillaume Jourjon, Emmanuel Lochin, Patrick S&eacu...
ISLPED
2006
ACM
119views Hardware» more  ISLPED 2006»
16 years 1 months ago
Process variation aware cache leakage management
In a few technology generations, limitations of fabrication processes will make accurate design time power estimates a daunting challenge. Static leakage current which comprises a...
Ke Meng, Russ Joseph
MIR
2006
ACM
200views Multimedia» more  MIR 2006»
16 years 1 months ago
An adaptive graph model for automatic image annotation
Automatic keyword annotation is a promising solution to enable more effective image search by using keywords. In this paper, we propose a novel automatic image annotation method b...
Jing Liu, Mingjing Li, Wei-Ying Ma, Qingshan Liu, ...