Sciweavers

1362 search results - page 127 / 273
» Means, Correlations and Bounds
Sort
View
JCDL
2011
ACM
226views Education» more  JCDL 2011»
14 years 4 months ago
Measuring historical word sense variation
We describe here a method for automatically identifying word sense variation in a dated collection of historical books in a large digital library. By leveraging a small set of kno...
David Bamman, Gregory Crane
KBSE
2007
IEEE
15 years 8 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
WDAG
2005
Springer
74views Algorithms» more  WDAG 2005»
15 years 7 months ago
On the Availability of Non-strict Quorum Systems
Abstract. Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow...
Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 6 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
FPCA
1989
15 years 5 months ago
F-Bounded Polymorphism for Object-Oriented Programming
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
Peter S. Canning, William R. Cook, Walter L. Hill,...