Sciweavers

4192 search results - page 134 / 839
» Efficient testing of groups
Sort
View
122
Voted
TMC
2010
130views more  TMC 2010»
14 years 11 months ago
Efficient Coverage Maintenance Based on Probabilistic Distributed Detection
—Many wireless sensor networks require sufficient sensing coverage over long periods of time. To conserve energy, a coverage maintenance protocol achieves desired coverage by act...
Guoliang Xing, Xiangmao Chang, Chenyang Lu, Jianpi...
TAICPART
2006
IEEE
183views Education» more  TAICPART 2006»
15 years 6 months ago
AutoAbstract: Problem Statement and Hypothetical Solutions
ract: Problem Statement and Hypothetical Solutions Shaukat Ali Verification and Testing Group (VT) Department of Computer Science University of Sheffield
Shaukat Ali
108
Voted
EDBT
2009
ACM
132views Database» more  EDBT 2009»
15 years 7 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
94
Voted
ICPPW
1999
IEEE
15 years 5 months ago
Building Dynamic Multicast Trees in Mobile Networks
As group applications become more prevalent, efficient network utilization becomes a major concern. Multicast transmission may use network bandwidth more efficiently than multiple...
Frank Adelstein, Golden G. Richard III, Loren Schw...
79
Voted
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
15 years 6 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur