Sciweavers

478 search results - page 85 / 96
» Improving probability bounds by optimization over subsets
Sort
View
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 7 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolutionary hypernetwork models for aptamer-based cardiovascular disease diagnosis
We present a biology-inspired probabilistic graphical model, called the hypernetwork model, and its application to medical diagnosis of disease. The hypernetwork models are a way ...
JungWoo Ha, Jae-Hong Eom, Sung-Chun Kim, Byoung-Ta...
EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 7 months ago
Scalable XQuery type matching
XML Schema awareness has been an integral part of the XQuery language since its early design stages. Matching XML data against XML types is the main operation that backs up XQuery...
Jens Teubner
INFOCOM
2006
IEEE
14 years 1 months ago
A Comparative Study of the DNS Design with DHT-Based Alternatives
— The current Domain Name System (DNS) follows a hierarchical tree structure. Several recent efforts proposed to re-implement DNS as a peer-to-peer network with a flat structure...
Vasileios Pappas, Daniel Massey, Andreas Terzis, L...
EUROCRYPT
2004
Springer
14 years 28 days ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo