Sciweavers

19320 search results - page 3679 / 3864
» On the complexity of computing determinants
Sort
View
ACMSE
2007
ACM
15 years 9 months ago
Verifying design modularity, hierarchy, and interaction locality using data clustering techniques
Modularity, hierarchy, and interaction locality are general approaches to reducing the complexity of any large system. A widely used principle in achieving these goals in designin...
Liguo Yu, Srini Ramaswamy
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 9 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
DEBS
2007
ACM
15 years 9 months ago
A taxonomy for denial of service attacks in content-based publish/subscribe systems
Denial of Service (DoS) attacks continue to affect the availability of critical systems on the Internet. The existing DoS problem is enough to merit significant research dedicated...
Alex Wun, Alex King Yeung Cheung, Hans-Arno Jacobs...
ICDCS
2010
IEEE
15 years 9 months ago
Extracting More Capacity from Multi-channel Multi-radio Wireless Networks by Exploiting Power
—Transmission power plays a crucial role in the design and performance of wireless networks. The issue is therefore complex since an increase in transmission power implies that a...
Devu Manikantan Shila, Yu Cheng, Tricha Anjali, Pe...
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 9 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
« Prev « First page 3679 / 3864 Last » Next »