Sciweavers

172 search results - page 3 / 35
» A Forward Analysis for Recurrent Sets
Sort
View
IEEEPACT
2006
IEEE
13 years 11 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
EMNLP
2010
13 years 3 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
TPDS
2008
231views more  TPDS 2008»
13 years 5 months ago
Anonymous Geo-Forwarding in MANETs through Location Cloaking
In this paper, we address the problem of destination anonymity for applications in mobile ad hoc networks where geographic information is ready for use in both ad hoc routing and I...
Xiaoxin Wu, Jun Liu, Xiaoyan Hong, Elisa Bertino
ISSRE
2006
IEEE
13 years 11 months ago
Memoized Forward Computation of Dynamic Slices
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
Wes Masri, Nagi Nahas, Andy Podgurski
SIGCOMM
2009
ACM
13 years 12 months ago
Opportunistic forwarding in workplaces
So far, the search for Opportunistic Network (ON) applications has focused on urban/rural scenarios where the combined use of mobility and the store-carry-and-forward paradigm hel...
Sabrina Gaito, Elena Pagani, Gian Paolo Rossi