Sciweavers

9842 search results - page 345 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
130
Voted
ICCD
2006
IEEE
109views Hardware» more  ICCD 2006»
16 years 1 months ago
Improving Scalability and Complexity of Dynamic Scheduler through Wakeup-Based Scheduling
This paper presents a new scheduling technique to improve the speed, power, and scalability of a dynamic scheduler. In a high-performance superscalar processor, the instruction sc...
Kuo-Su Hsiao, Chung-Ho Chen
ICASSP
2009
IEEE
15 years 10 months ago
Fast noise PSD estimation with low complexity
Although noise PSD estimation is a crucial part of noise reduction algorithms, most noise PSD estimators have problems in tracking non-stationary noise sources. Recently, a noise ...
Richard C. Hendriks, Richard Heusdens, Jesper Jens...
CIKM
2009
Springer
15 years 10 months ago
Role of weak ties in link prediction of complex networks
Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In th...
Linyuan Lu, Tao Zhou
VR
2008
IEEE
136views Virtual Reality» more  VR 2008»
15 years 10 months ago
Uncertainty Boundaries for Complex Objects in Augmented Reality
Registration errors between the physical world and computergenerated objects are a central problem in Augmented Reality (AR) systems. Some existing AR systems have demonstrated ho...
Jiajian Chen, Blair MacIntyre
ICC
2007
IEEE
113views Communications» more  ICC 2007»
15 years 10 months ago
Complexity and Error Propagation of Localization Using Interferometric Ranging
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
Rui Huang, Gergely V. Záruba, Manfred Huber