Sciweavers

747 search results - page 131 / 150
» Theory and Construction of Molecular Computers
Sort
View
FOCS
2009
IEEE
16 years 25 days ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
ICALP
2005
Springer
15 years 11 months ago
Discrete Random Variables over Domains
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...
Michael W. Mislove
NIPS
1997
15 years 7 months ago
Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks
A Lyapunov function for excitatory-inhibitory networks is constructed. The construction assumes symmetric interactions within excitatory and inhibitory populations of neurons, and...
H. Sebastian Seung, Tom J. Richardson, J. C. Lagar...
TLDI
2010
ACM
190views Formal Methods» more  TLDI 2010»
16 years 3 months ago
Distributed programming with distributed authorization
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
Kumar Avijit, Anupam Datta, Robert Harper
DOCENG
2006
ACM
16 years 1 days ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda