Sciweavers

2165 search results - page 333 / 433
» cases 2005
Sort
View
IPSN
2005
Springer
15 years 3 months ago
Maximizing system lifetime in wireless sensor networks
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
Qunfeng Dong
ISAAC
2005
Springer
98views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Complexity of the Min-Max (Regret) Versions of Cut Problems
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
ISAAC
2005
Springer
138views Algorithms» more  ISAAC 2005»
15 years 3 months ago
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
Zhixiang Chen, Bin Fu
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk