Sciweavers

7986 search results - page 434 / 1598
» Computational Science and its Applications
Sort
View
FOCS
1992
IEEE
15 years 10 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
CSE
2009
IEEE
15 years 10 months ago
Socially Enhanced Network Address Translation
—The rapid evolution of the Internet has forced the use of Network Address Translation (NAT) to help slow the decline of publicly available IPv4 address space. While NAT provides...
Alexis Malozemoff, Muthucumaru Maheswaran
AAAI
2004
15 years 8 months ago
Evaluating Ontology Cleaning
Ontology as a discipline of Computer Science has made many claims about its usefulness, however to date there has been very little evaluation of those claims. We present the resul...
Christopher A. Welty, Ruchi Mahindru, Jennifer Chu...
CAD
2008
Springer
15 years 7 months ago
Identification of C1 and C2 discontinuities for surface meshes in CAD
In computer-aided design and meshing, it is often important to identify the discontinuities (singularities) in coarse surface meshes. Due to the potential low resolution and noise...
Xiangmin Jiao, Narasimha R. Bayyana
CAD
2006
Springer
15 years 7 months ago
Geometric constraints within feature hierarchies
We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the featu...
Meera Sitharam, Jianjun Oung, Yong Zhou, Adam Arbr...