Sciweavers

161 search results - page 28 / 33
» Setting port numbers for fast graph exploration
Sort
View
SCP
1998
112views more  SCP 1998»
13 years 7 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
SEMWEB
2009
Springer
14 years 2 months ago
Context and Domain Knowledge Enhanced Entity Spotting in Informal Text
This paper explores the application of restricted relationship graphs (RDF) and statistical NLP techniques to improve named entity annotation in challenging Informal English domain...
Daniel Gruhl, Meenakshi Nagarajan, Jan Pieper, Chr...
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 2 days ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
LCPC
2001
Springer
14 years 5 days ago
A Comparative Evaluation of Parallel Garbage Collector Implementations
While uniprocessor garbage collection is relatively well understood, experience with collectors for large multiprocessor servers is limited and it is unknown which techniques best ...
C. Richard Attanasio, David F. Bacon, Anthony Cocc...
BMCBI
2007
143views more  BMCBI 2007»
13 years 7 months ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...