Sciweavers

5653 search results - page 1046 / 1131
» Distributed Conceptual Structures
Sort
View
217
Voted
POPL
2003
ACM
16 years 2 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
157
Voted
RECOMB
2004
Springer
16 years 2 months ago
Computational identification of evolutionarily conserved exons
Phylogenetic hidden Markov models (phylo-HMMs) have recently been proposed as a means for addressing a multispecies version of the ab initio gene prediction problem. These models ...
Adam C. Siepel, David Haussler
121
Voted
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 2 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
111
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 2 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
216
Voted
VLDB
2004
ACM
112views Database» more  VLDB 2004»
16 years 2 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
« Prev « First page 1046 / 1131 Last » Next »