130 search results - page 10 / 26 » Efficiently Verifiable Escape Analysis |
TMC
2008
13 years 7 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—Wireless sensor networks place sensors into an area to collect data and send them back to a base station. Data fusion, in which collected data are fused before they are sent to ...
ICDE
2012
IEEE
12 years 6 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
ion Refinement by Controllability and Cooperativeness Analysis Freddy Y.C. Mang and Pei-Hsin Ho Advanced Technology Group, Synopsys, Inc. {fmang, pho}@synopsys.com nt a new abstrac...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...