4009 search results - page 620 / 802 » Clustering on Complex Graphs |
150
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
150
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
185
click to vote
MDM
2009
Springer
16 years 24 days ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
175
click to vote
ICCSA
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
167
click to vote
ISSRE
2006
IEEE
16 years 8 days ago
2006
IEEE
BPEL is a language that could express complex concurrent behaviors. This paper presents a novel method of BPEL test case generation, which is based on concurrent path analysis. Th...