Sciweavers

3692 search results - page 372 / 739
» Active learning and its use in computer science
Sort
View
202
Voted
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...
175
Voted
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
ACMSE
2006
ACM
15 years 8 months ago
Composing aggregate web services in BPEL
Web services are increasingly being used to expose applications over the Internet. These Web services are being integrated within and across enterprises to create higher function ...
Onyeka Ezenwoye, Seyed Masoud Sadjadi
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
TCS
2010
15 years 5 months ago
Comparing notions of randomness
Abstract. It is an open problem in the area of effective (algorithmic) randomness whether Kolmogorov-Loveland randomness coincides with Martin-L¨of randomness. Joe Miller and And...
Bart Kastermans, Steffen Lempp