Sciweavers

9842 search results - page 295 / 1969
» Problem complexity
Sort
View
CCR
2006
122views more  CCR 2006»
15 years 6 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
189
Voted
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
16 years 1 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
ICIP
2005
IEEE
16 years 8 months ago
Image fusion using a new framework for complex wavelet transforms
Image fusion is the process of extracting meaningful visual information from two or more images and combinining them to form one fused image. Image fusion is important within many...
Paul R. Hill, David R. Bull, Cedric Nishan Canagar...
244
Voted
BMCBI
2005
156views more  BMCBI 2005»
15 years 6 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer
FOCS
1999
IEEE
15 years 11 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl