Sciweavers

10608 search results - page 562 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PODC
2009
ACM
15 years 11 months ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
15 years 9 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
ICAT
2007
IEEE
15 years 8 months ago
New Tetrahedral Mesh Generation Method based on Delaunay Criteria and Space Disassembling
The requirement of tetrahedral mesh generation algorithm, which is a prerequisite of many soft tissue simulation methods, becomes very strict because of the real-time requirement ...
Xiao Yu, Weitao Chen, Pengfei Huang, Sizhe Lv, Lix...
TEC
2008
98views more  TEC 2008»
15 years 7 months ago
Opposition-Based Differential Evolution
Evolutionary Algorithms (EAs) are well-known optimization approaches to cope with non-linear, complex problems. These population-based algorithms, however, suffer from a general we...
Shahryar Rahnamayan, Hamid R. Tizhoosh, Magdy M. A...
ACL
2010
15 years 5 months ago
Efficient Staggered Decoding for Sequence Labeling
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
Nobuhiro Kaji, Yasuhiro Fujiwara, Naoki Yoshinaga,...