Sciweavers

1732 search results - page 122 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
ISCAPDCS
2007
15 years 8 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
MCSS
2006
Springer
15 years 6 months ago
Optimal input sets for time minimality in quantized control systems
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...
Alessia Marigo
MOC
1998
93views more  MOC 1998»
15 years 6 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
BMCBI
2005
114views more  BMCBI 2005»
15 years 6 months ago
AutoFACT: An Automatic Functional Annotation and Classification Tool
Background: Assignment of function to new molecular sequence data is an essential step in genomics projects. The usual process involves similarity searches of a given sequence aga...
Liisa B. Koski, Michael W. Gray, B. Franz Lang, Ge...
LACL
1998
Springer
15 years 10 months ago
Sequential Construction of Logical Forms
In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongs...
Wilfried Meyer-Viol