Sciweavers

3096 search results - page 453 / 620
» Theory and Use of the EM Algorithm
Sort
View
ICFP
2004
ACM
16 years 6 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester
DAGSTUHL
2011
14 years 6 months ago
Interactive Isocontouring of High-Order Surfaces
Scientists and engineers are making increasingly use of hp-adaptive discretization methods to compute simulations. While techniques for isocontouring the high-order data generated...
Christian Azambuja Pagot, Joachim E. Vollrath, Fil...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
ICFP
2003
ACM
16 years 6 months ago
A static type system for JVM access control
This paper presents a static type system for JAVA Virtual Machine (JVM) code that enforces an access control mechanism similar to the one found, for example, in a JAVA implementat...
Tomoyuki Higuchi, Atsushi Ohori
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
16 years 14 hour ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami