Sciweavers

21324 search results - page 179 / 4265
» Making the case for computing
Sort
View
142
Voted
SYNTHESE
2011
72views more  SYNTHESE 2011»
14 years 10 months ago
Science without (parametric) models: the case of bootstrap resampling
Scientific and statistical inferences build heavily on explicit, parametric models, and often with good reasons. However, the limited scope of parametric models and the increasin...
Jan Sprenger
109
Voted
ICCTA
2007
IEEE
15 years 9 months ago
Semantic Analysis of 'to'
‘To’ is one of the most common lexemes in English (as found in 34% of the sentences in the Penn Tree Bank corpus). This paper describes the analysis of the sentences involving...
Ashish Francis Almeida, Rajat Kumar Mohanty, Pushp...
BROADNETS
2004
IEEE
15 years 7 months ago
A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call...
Frederick Ducatelle, Luca Maria Gambardella
148
Voted
ACL
2012
13 years 5 months ago
Toward Automatically Assembling Hittite-Language Cuneiform Tablet Fragments into Larger Texts
This paper presents the problem within Hittite and Ancient Near Eastern studies of fragmented and damaged cuneiform texts, and proposes to use well-known text classification metr...
Stephen Tyndall
122
Voted
IPPS
2007
IEEE
15 years 9 months ago
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
Juan Paulo Alvarado-Magaña, José Alb...