Sciweavers

3604 search results - page 554 / 721
» All Common Subsequences
Sort
View
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 8 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
IUI
1993
ACM
15 years 8 months ago
Reducing user effort in collaboration support
incompatibility. We introduce Mona, an operational email system embodying this automatic approach. Mona establishes conversation context independently of user actions through the ...
Andy Cockburn, Harold W. Thimbleby
CASES
2007
ACM
15 years 8 months ago
Stack size reduction of recursive programs
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
Stefan Schäckeler, Weijia Shang
CCS
2007
ACM
15 years 8 months ago
Analyzing network traffic to detect self-decrypting exploit code
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are...
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Pu...
DEBS
2007
ACM
15 years 8 months ago
Modeling the communication costs of content-based routing: the case of subscription forwarding
Content-based routing (CBR) provides the core distribution support of several middleware paradigms, most notably content-based publish-subscribe. Despite its popularity, however, ...
Stefano Castelli, Paolo Costa, Gian Pietro Picco