Sciweavers

1094 search results - page 88 / 219
» One Size Fits All
Sort
View
KDID
2003
144views Database» more  KDID 2003»
13 years 10 months ago
What You Store is What You Get
d abstract) Floris Geerts, Bart Goethals, and Taneli Mielik¨ainen HIIT Basic Research Unit Department of Computer Science University of Helsinki, Finland Abstract. Recent studies ...
Floris Geerts, Bart Goethals, Taneli Mielikäi...
ACL
1996
13 years 10 months ago
Another Facet of LIG Parsing
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
Pierre Boullier
ISMB
1996
13 years 10 months ago
Improving the Quality of Automatic DNA Sequence Assembly Using Fluorescent Trace-Data Classifications
Virtually all large-scale sequencing projects use automatic sequence-assembly programs to aid in the determination of DNA sequences. The computer-generated assemblies require subs...
Carolyn F. Allex, Schuyler F. Baldwin, Jude W. Sha...
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
13 years 9 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
13 years 9 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein