Sciweavers

4199 search results - page 506 / 840
» Generalizing Data in Natural Language
Sort
View
186
Voted
LISP
2008
96views more  LISP 2008»
15 years 6 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
ML
2008
ACM
109views Machine Learning» more  ML 2008»
15 years 6 months ago
O'browser: objective caml on browsers
We present a way to run Objective Caml programs on a standard, unmodified web browser, with a compatible data representation and execution model, including concurrency. To achieve...
Benjamin Canou, Vincent Balat, Emmanuel Chailloux
SIGSOFT
2008
ACM
16 years 7 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
EDBT
2010
ACM
147views Database» more  EDBT 2010»
16 years 1 months ago
A simple (yet powerful) algebra for pervasive environments
Querying non-conventional data is recognized as a major issue in new environments and applications such as those occurring in pervasive computing. A key issue is the ability to qu...
Yann Gripay, Frédérique Laforest, Je...
PLDI
1993
ACM
15 years 10 months ago
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
Jennifer-Ann M. Anderson, Monica S. Lam