Sciweavers

5434 search results - page 1047 / 1087
» Tool support for MOLA
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 22 days ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
VLDB
1994
ACM
121views Database» more  VLDB 1994»
14 years 22 days ago
An Overview of Repository Technology
A repository is a shareddatabaseof information aboutengineeredartifacts.Wedefinea repository manager to be a databaseapplication that suPports checkout/checkin, version and config...
Philip A. Bernstein, Umeshwar Dayal
BIBE
2007
IEEE
141views Bioinformatics» more  BIBE 2007»
14 years 20 days ago
Graph and Topological Structure Mining on Scientific Articles
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
Fan Wang, Ruoming Jin, Gagan Agrawal, Helen Piontk...
CCS
2007
ACM
14 years 19 days ago
Highly efficient techniques for network forensics
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
Miroslav Ponec, Paul Giura, Hervé Brön...
CGO
2009
IEEE
14 years 19 days ago
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications
Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI and PVM. Its importance...
Greg Bronevetsky
« Prev « First page 1047 / 1087 Last » Next »