Sciweavers

555 search results - page 87 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
WWW
2007
ACM
14 years 8 months ago
A high-performance interpretive approach to schema-directed parsing
XML delivers key advantages in interoperability due to its flexibility, expressiveness, and platform-neutrality. As XML has become a performance-critical aspect of the next genera...
Morris Matsa, Eric Perkins, Abraham Heifets, Marga...
IEEESCC
2007
IEEE
14 years 2 months ago
Swift: Fast, Reliable, Loosely Coupled Parallel Computation
A common pattern in scientific computing involves the execution of many tasks that are coupled only in the sense that the output of one may be passed as input to one or more other...
Yong Zhao, Mihael Hategan, Ben Clifford, Ian T. Fo...
CSL
2004
Springer
14 years 1 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
ECOOP
1999
Springer
14 years 17 hour ago
Visualizing Reference Patterns for Solving Memory Leaks in Java
Many Java programmers believe they do not have to worry about memory management because of automatic garbage collection. In fact, many Java programs run out of memory unexpectedly ...
Wim De Pauw, Gary Sevitsky
WOSP
1998
ACM
13 years 12 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...