Sciweavers

1423 search results - page 243 / 285
» Languages of Nested Trees
Sort
View
ICALP
1994
Springer
15 years 10 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
AOSD
2007
ACM
15 years 10 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore
ICALP
2007
Springer
15 years 10 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan
CICLING
2006
Springer
15 years 9 months ago
Predicting Dialogue Acts from Prosodic Information
In this paper, the influence of intonation to recognize dialogue acts from speech is assessed. Assessment is based on an empirical approach: manually tagged data from a spoken-dial...
Sergio Rafael Coria Olguin, Luis Alberto Pineda Co...
JAVA
2000
Springer
15 years 9 months ago
A portable sampling-based profiler for Java virtual machines
This paper describes a portable and efficient sampling-based online measurement system for production-level Java virtual machines. This system is designed to provide continuous re...
John Whaley