Sciweavers

24554 search results - page 227 / 4911
» Dependable distributed systems
Sort
View
NAACL
2003
15 years 7 months ago
A low-complexity, broad-coverage probabilistic Dependency Parser for English
Large-scale parsing is still a complex and timeconsuming process, often so much that it is infeasible in real-world applications. The parsing system described here addresses this ...
Gerold Schneider
TCAD
2008
80views more  TCAD 2008»
15 years 6 months ago
Efficient Extraction of Frequency-Dependent Substrate Parasitics Using Direct Boundary Element Method
An efficient method based on a direct boundary element method is proposed for extracting frequency-dependent substrate coupling parameters. A frequency-independent real-valued line...
Wenjian Yu, Xiren Wang, Zuochang Ye, Zeyi Wang
CORR
1998
Springer
127views Education» more  CORR 1998»
15 years 6 months ago
Towards an implementable dependency grammar
Syntactic models should be descriptively adequate and parsable. A syntactic description is autonomous in the sense that it has certain explicitformal properties. Such a descriptio...
Timo Järvinen, Pasi Tapanainen
LCPC
1994
Springer
15 years 10 months ago
Minimal Data Dependence Abstractions for Loop Transformations
Data Dependence Abstractions for Loop Transformations Yi-Qing Yang Corinne Ancourt Francois Irigoin Ecole des Mines de Paris/CRI 77305 Fontainebleau Cedex France tractions of prog...
Yi-Qing Yang, Corinne Ancourt, François Iri...
CPC
2006
93views more  CPC 2006»
15 years 6 months ago
Distribution of Vertex Degree in Web-Graphs
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
Colin Cooper