Sciweavers

882 search results - page 7 / 177
» On self-embeddings of computable linear orderings
Sort
View
103
Voted
BMCBI
2010
124views more  BMCBI 2010»
15 years 16 days ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
214
Voted
INFOCOM
2011
IEEE
14 years 3 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
127
Voted
MFCS
2001
Springer
15 years 4 months ago
Automata on Linear Orderings
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
Véronique Bruyère, Olivier Carton
88
Voted
COLING
2002
15 years 7 days ago
A Quantitative Model of Word Order and Movement in English, Dutch and German Complement Constructions
We present a quantitative model of word order and movement constraints that enables a simple and uniform treatment of a seemingly heterogeneous collection of linear order phenomena...
Karin Harbusch, Gerard Kempen
71
Voted
LICS
2005
IEEE
15 years 6 months ago
The Geometry of Linear Higher-Order Recursion
Ugo Dal Lago