Sciweavers

1097 search results - page 209 / 220
» Partial evaluation of Maple
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 9 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
ISSTA
2007
ACM
13 years 9 months ago
Instrumenting where it hurts: an automatic concurrent debugging technique
As concurrent and distributive applications are becoming more common and debugging such applications is very difficult, practical tools for automatic debugging of concurrent appl...
Rachel Tzoref, Shmuel Ur, Elad Yom-Tov
ACL
2008
13 years 9 months ago
Unsupervised Learning of Acoustic Sub-word Units
Accurate unsupervised learning of phonemes of a language directly from speech is demonstrated via an algorithm for joint unsupervised learning of the topology and parameters of a ...
Balakrishnan Varadarajan, Sanjeev Khudanpur, Emman...
DIMVA
2010
13 years 9 months ago
HookScout: Proactive Binary-Centric Hook Detection
Abstract. In order to obtain and maintain control, kernel malware usually makes persistent control flow modifications (i.e., installing hooks). To avoid detection, malware develope...
Heng Yin, Pongsin Poosankam, Steve Hanna, Dawn Xia...
IM
2007
13 years 9 months ago
Robust Monitoring of Network-wide Aggregates through Gossiping
Abstract—We investigate the use of gossip protocols for continuous monitoring of network-wide aggregates under crash failures. Aggregates are computed from local management varia...
Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Cl...