Sciweavers

101 search results - page 2 / 21
» Complexity Analysis of Weak Multitolerance
Sort
View
GLOBECOM
2006
IEEE
13 years 11 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
AML
2007
77views more  AML 2007»
13 years 5 months ago
Complex analysis in subsystems of second order arithmetic
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...
Keita Yokoyama
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
14 years 5 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
SPAA
2009
ACM
14 years 2 days ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
ICDAR
2009
IEEE
14 years 18 hour ago
Text Detection and Localization in Complex Scene Images using Constrained AdaBoost Algorithm
We have proposed a complete system for text detection and localization in gray scale scene images. A boosting framework integrating feature and weak classifier selection based on...
Shehzad Muhammad Hanif, Lionel Prevost