Sciweavers

256 search results - page 35 / 52
» Application-Only Call Graph Construction
Sort
View
ICDM
2002
IEEE
173views Data Mining» more  ICDM 2002»
14 years 2 months ago
Mining Genes in DNA Using GeneScout
In this paper, we present a new system, called GeneScout, for predicting gene structures in vertebrate genomic DNA. The system contains specially designed hidden Markov models (HM...
Michael M. Yin, Jason Tsong-Li Wang
TACAS
2001
Springer
119views Algorithms» more  TACAS 2001»
14 years 2 months ago
Compositional Message Sequence Charts
Abstract. A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication pro...
Elsa L. Gunter, Anca Muscholl, Doron Peled
ESCIENCE
2007
IEEE
14 years 1 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
ICSE
1995
IEEE-ACM
14 years 1 months ago
A Compact Petri Net Representation for Concurrent Programs
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
Matthew B. Dwyer, Lori A. Clarke, Kari A. Nies
FOCS
1994
IEEE
14 years 1 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid