Sciweavers

1967 search results - page 385 / 394
» The Case for Determinism in Database Systems
Sort
View
PASTE
2010
ACM
15 years 26 days ago
Null dereference analysis in practice
Many analysis techniques have been proposed to determine when a potentially null value may be dereferenced. But we have observed in practice that not every potential null derefere...
Nathaniel Ayewah, William Pugh
100
Voted
DEBS
2008
ACM
15 years 13 hour ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
BMCBI
2008
87views more  BMCBI 2008»
14 years 11 months ago
Volume-based solvation models out-perform area-based models in combined studies of wild-type and mutated protein-protein interfa
Background: Empirical binding models have previously been investigated for the energetics of protein complexation (G models) and for the influence of mutations on complexation (i....
Salim Bougouffa, Jim Warwicker
97
Voted
JAIR
2008
164views more  JAIR 2008»
14 years 11 months ago
Gesture Salience as a Hidden Variable for Coreference Resolution and Keyframe Extraction
Gesture is a non-verbal modality that can contribute crucial information to the understanding of natural language. But not all gestures are informative, and non-communicative hand...
Jacob Eisenstein, Regina Barzilay, Randall Davis
133
Voted
CORR
2004
Springer
177views Education» more  CORR 2004»
14 years 10 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard