Sciweavers

5100 search results - page 224 / 1020
» The Linear Complexity of a Graph
Sort
View
78
Voted
STACS
2010
Springer
15 years 7 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
79
Voted
ICC
2007
IEEE
15 years 7 months ago
Determination of Optimal Distortion-Based Protection in Progressive Image Transmission: a Heuristic Approach
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
Alessio Torquati, Maria Fresia, Fabio Lavagetto
99
Voted
IPPS
2006
IEEE
15 years 6 months ago
Plan switching: an approach to plan execution in changing environments
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal st...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...
106
Voted
ICSE
2008
IEEE-ACM
16 years 1 months ago
Predicting defects using network analysis on dependency graphs
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...
Thomas Zimmermann, Nachiappan Nagappan
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
15 years 6 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...