Sciweavers

710 search results - page 83 / 142
» On Minimum Power Connectivity Problems
Sort
View
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 11 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
CIE
2007
Springer
14 years 4 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
14 years 3 months ago
Resource-constrained low-power bus encoding with crosstalk delay elimination
— In deep-submicron (DSM) technology, minimizing power consumption of a bus is one of the most important design objectives in embedded system-on-chip (SoC) design. In this paper,...
Meeyoung Cha, Chun-Gi Lyuh, Taewhan Kim
VTC
2008
IEEE
120views Communications» more  VTC 2008»
14 years 4 months ago
A Comprehensive Performance Comparison of OFDM/TDM Using MMSE-FDE and Conventional OFDM
—Orthogonal frequency division multiplexing (OFDM) is currently under intense research for broadband wireless transmission due to its robustness against multipath fading. However...
Haris Gacanin, Fumiyuki Adachi
CVPR
2009
IEEE
15 years 5 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu