Results 1  10
of
1,113
Steps toward artificial intelligence
 Computers and Thought
, 1961
"... Harvard University. The work toward attaining "artificial intelligence’ ’ is the center of considerable computer research, design, and application. The field is in its starting transient, characterized by many varied and independent efforts. Marvin Minsky has been requested to draw this wor ..."
Abstract

Cited by 248 (0 self)
 Add to MetaCart
this work together into a coherent summary, supplement it with appropriate explanatory or theoretical noncomputer information, and introduce his assessment of the state of the art. This paper emphasizes the class of activities in which a generalpurpose computer, complete with a library of basic programs
Combining evidence using pvalues: Application to sequence homology searches
 Bioinformatics
, 1998
"... Motivation: To illustrate an intuitive and statistically valid method for combining independent sources of evidence that yields a pvalue for the complete evidence, and to apply it to the problem of detecting simultaneous matches to multiple patterns in sequence homology searches. Results: In seque ..."
Abstract

Cited by 228 (13 self)
 Add to MetaCart
Motivation: To illustrate an intuitive and statistically valid method for combining independent sources of evidence that yields a pvalue for the complete evidence, and to apply it to the problem of detecting simultaneous matches to multiple patterns in sequence homology searches. Results
Reduce to the Max: A Simple Approach for MassiveScale PrivacyPreserving Collaborative Network Measurements∗
"... Privacypreserving techniques for distributed computation have been proposed recently as a promising framework in collaborative interdomain network monitoring. Several different approaches exist to solve such class of problems, e.g., Homomorphic Encryption (HE) and Secure Multiparty Computation ( ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Privacypreserving techniques for distributed computation have been proposed recently as a promising framework in collaborative interdomain network monitoring. Several different approaches exist to solve such class of problems, e.g., Homomorphic Encryption (HE) and Secure Multiparty Com
Preserving privacy in gps traces via uncertaintyaware path cloaking
 In Proceedings of ACM CCS 2007
, 2007
"... Motivated by a probevehicle based automotive traffic monitoring system, this paper considers the problem of guaranteed anonymity in a dataset of location traces while maintaining high data accuracy. We find through analysis of a set of GPS traces from 233 vehicles that known privacy algorithms cann ..."
Abstract

Cited by 60 (5 self)
 Add to MetaCart
Motivated by a probevehicle based automotive traffic monitoring system, this paper considers the problem of guaranteed anonymity in a dataset of location traces while maintaining high data accuracy. We find through analysis of a set of GPS traces from 233 vehicles that known privacy algorithms
A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node
 IEEE Journal on Selected Areas in Communications
, 1995
"... AbstractA new approach to determining the admissibility of variable bit rate (VBR) traffic in buffered digital networks is developed. In this approach all traffic presented to the network is assumed to have been subjected to leakybucket regulation, and extremal, periodic, onoff regulated traffic ..."
Abstract

Cited by 164 (10 self)
 Add to MetaCart
. This leads to a singleresource statisticalmultiplexing problem which is solved using techniques previously used for unbuffered traffic. VBR traffic is found to be divisible into two classes, one for which statistical multiplexing is effective and one for which statistical multiplexing is ineffective
Tractable conservative Constraint Satisfaction Problems
"... In a constraint satisfaction problem (CSP) the aim is to find an assignment of values to a given set of variables, subject to specified constraints. The CSP is known to be NPcomplete in general. However, certain restrictions on the form of the allowed constraints can lead to problems solvable in po ..."
Abstract

Cited by 118 (13 self)
 Add to MetaCart
constraint languages that give rise to CSP classes solvable in polynomial time. In particular, this result allows us to obtain a complete description of those (directed) graphs H for which the LIST HCOLORING problem is polynomial time solvable.
On Syntactic versus Computational Views of Approximability
, 1994
"... We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximabilit ..."
Abstract

Cited by 126 (10 self)
 Add to MetaCart
approximability is wellunderstood. Our results provide a syntactic characterization of computational classes, and give a computational framework for syntactic classes. We compare the syntactically defined class MAX SNP with the computationally defined class APX, and show that every problem in APX can be “placed
A Complete Problem for Statistical Zero Knowledge
, 2002
"... We present the rst complete problem for SZK, the class of promise problems possessing statistical zeroknowledge proofs (against an honest veri er). The problem, called Statistical Difference, is to decide whether two eciently samplable distributions are either statistically close or far apart. Th ..."
Abstract

Cited by 48 (15 self)
 Add to MetaCart
. This gives a new characterization of SZK that makes no reference to interaction or zero knowledge. We propose the use of complete problems to unify and extend the study of statistical zero knowledge. To this end, we examine several consequences of our Completeness Theorem and its proof, such as: A way
A Complete Promise Problem for Statistical ZeroKnowledge
 In Proceedings of the 38th Annual Symposium on the Foundations of Computer Science
, 1997
"... We present a complete promise problem for SZK, the class of languages possessing statistical zeroknowledge proofs (against an honest verifier). The problem is to decide whether two efficiently samplable distributions are either statistically close or far apart. This characterizes SZK with no refer ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
We present a complete promise problem for SZK, the class of languages possessing statistical zeroknowledge proofs (against an honest verifier). The problem is to decide whether two efficiently samplable distributions are either statistically close or far apart. This characterizes SZK
Fibring: Completeness Preservation
 Journal of Symbolic Logic
, 2000
"... A completeness theorem is established for logics with congruence endowed with general semantics (in the style of general frames). As a corollary, completeness is shown to be preserved by bring logics with congruence provided that congruence is retained in the resulting logic. The class of logics ..."
Abstract

Cited by 50 (24 self)
 Add to MetaCart
A completeness theorem is established for logics with congruence endowed with general semantics (in the style of general frames). As a corollary, completeness is shown to be preserved by bring logics with congruence provided that congruence is retained in the resulting logic. The class
Results 1  10
of
1,113