Sciweavers

2432 search results - page 120 / 487
» Degrees and choice numbers
Sort
View
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
15 years 10 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
EUROCRYPT
2008
Springer
15 years 8 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
ATVA
2005
Springer
202views Hardware» more  ATVA 2005»
15 years 12 months ago
Model Checking Real Time Java Using Java PathFinder
Abstract. The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real t...
Gary Lindstrom, Peter C. Mehlitz, Willem Visser
JC
2007
64views more  JC 2007»
15 years 6 months ago
Quadrature in Besov spaces on the Euclidean sphere
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup f...
Kerstin Hesse, H. N. Mhaskar, Ian H. Sloan
POPL
2011
ACM
14 years 9 months ago
Pick your contexts well: understanding object-sensitivity
ensitivity has emerged as an excellent context abstraction for points-to analysis in object-oriented languages. Despite its practical success, however, object-sensitivity is poorl...
Yannis Smaragdakis, Martin Bravenboer, Ondrej Lhot...