Sciweavers

784 search results - page 139 / 157
» Relaxing the Value Restriction
Sort
View
WWW
2007
ACM
14 years 9 months ago
XML design for relational storage
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
Solmaz Kolahi, Leonid Libkin
POPL
2009
ACM
14 years 9 months ago
Bidirectionalization for free! (Pearl)
A bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source b...
Janis Voigtländer
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
RECOMB
2008
Springer
14 years 9 months ago
Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony
Understanding the variation of recombination rates across a given genome is crucial for disease gene mapping and for detecting signatures of selection, to name just a couple of app...
Jotun Hein, Rune B. Lyngsø, Yun S. Song
ICFP
2003
ACM
14 years 9 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...