Sciweavers

1747 search results - page 151 / 350
» Long Range Dependence
Sort
View
IWPEC
2009
Springer
16 years 1 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke
DSD
2008
IEEE
136views Hardware» more  DSD 2008»
16 years 1 months ago
Flexible Baseband Architectures for Future Wireless Systems
— The mobile communication systems today, have different radio spectrum, radio access technologies, and protocol stacks depending on the network being utilized. This gives rise t...
Najam-ul-Islam Muhammad, Rizwan Rasheed, Renaud Pa...
IEEEARES
2008
IEEE
16 years 29 days ago
RTQG: Real-Time Quorum-based Gossip Protocol for Unreliable Networks
We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
Bo Zhang, Kai Han, Binoy Ravindran, E. Douglas Jen...
DFT
2007
IEEE
86views VLSI» more  DFT 2007»
16 years 27 days ago
Production Yield and Self-Configuration in the Future Massively Defective Nanochips
We address two problems in this work, namely, 1) the resilience challenge in the future chips made up of massively defective nanoelements and organized in replicative multicore ar...
Piotr Zajac, Jacques Henri Collet
ICMCS
2007
IEEE
133views Multimedia» more  ICMCS 2007»
16 years 26 days ago
Foreground Segmentation in Surveillance Scenes Containing a Door
We propose a new method for performing accurate background subtraction in scenes with a door, like a building entrance or a hallway. This kind of scene is common in surveillance a...
Andrew Miller, Mubarak Shah