Sciweavers

710 search results - page 93 / 142
» On Minimum Power Connectivity Problems
Sort
View
CASES
2009
ACM
13 years 8 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
GLOBECOM
2007
IEEE
14 years 4 months ago
Multiconstrained QoS Routing: Greedy is Good
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
Guoliang Xue, Weiyi Zhang
IPPS
2007
IEEE
14 years 4 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
WIOPT
2006
IEEE
14 years 4 months ago
Connection-level QoS provisioning in multiple transmission technology-based OFDM system
A state-of-the-art orthogonal frequency division multiplexing (OFDM)-based access system, such as the DiffSeg system [1][2], uses a different set of transmission technologies, e.g...
Youngkyu Choi, Sunghyun Choi, Sung-Pil Hong
ICAS
2005
IEEE
90views Robotics» more  ICAS 2005»
14 years 3 months ago
A TCP-Friendly Stateless AQM Scheme for Fair Bandwidth Allocation
Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of provid...
Cheng-Yuan Hoa, Yi-Cheng Chan, Yaw-Chung Chen