Sciweavers

313 search results - page 56 / 63
» Redundancy Elimination for LF
Sort
View
ICFP
2009
ACM
16 years 6 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
16 years 6 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
EDBT
2006
ACM
127views Database» more  EDBT 2006»
16 years 6 months ago
Progressive Query Optimization for Federated Queries
Federated queries are regular relational queries accessing data on one or more remote relational or non-relational data sources, possibly combining them with tables stored in the ...
Stephan Ewen, Holger Kache, Volker Markl, Vijaysha...
EUROSYS
2007
ACM
16 years 3 months ago
Sealing OS processes to improve dependability and safety
In most modern operating systems, a process is a -protected abstraction for isolating code and data. This protection, however, is selective. Many common mechanisms—dynamic code ...
Galen C. Hunt, Mark Aiken, Manuel Fähndrich, ...
WWW
2010
ACM
16 years 1 months ago
Smart caching for web browsers
In modern Web applications, style formatting and layout calculation often account for a substantial amount of local Web page processing time. In this paper1 , we present two novel...
Kaimin Zhang, Lu Wang, Aimin Pan, Bin Benjamin Zhu