Sciweavers

1301 search results - page 178 / 261
» Specifications via Realizability
Sort
View
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
14 years 1 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
COMPGEOM
2003
ACM
14 years 1 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
GCC
2003
Springer
14 years 28 days ago
Constructing Secure Web Service Based on XML
The paper discusses XML security key technologies related with security of Web service. Based on these discussions, Web service is integrated with some mature security architecture...
Shaomin Zhang, Baoyi Wang, Lihua Zhou
ICDCS
2002
IEEE
14 years 20 days ago
A Practical Approach for ?Zero? Downtime in an Operational Information System
An Operational Information System (OIS) supports a real-time view of an organization’s information critical to its logistical business operations. A central component of an OIS ...
Ada Gavrilovska, Karsten Schwan, Van Oleson
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 16 days ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...