Results 1  10
of
10,967
Inverse entailment and Progol
, 1995
"... This paper firstly provides a reappraisal of the development of techniques for inverting deduction, secondly introduces ModeDirected Inverse Entailment (MDIE) as a generalisation and enhancement of previous approaches and thirdly describes an implementation of MDIE in the Progol system. Progol ..."
Abstract

Cited by 719 (61 self)
 Add to MetaCart
is implemented in C and available by anonymous ftp. The reassessment of previous techniques in terms of inverse entailment leads to new results for learning from positive data and inverting implication between pairs of clauses.
Learning the Kernel Matrix with SemiDefinite Programming
, 2002
"... Kernelbased learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information ..."
Abstract

Cited by 775 (21 self)
 Add to MetaCart
Kernelbased learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information
Pictorial Structures for Object Recognition
 IJCV
, 2003
"... In this paper we present a statistical framework for modeling the appearance of objects. Our work is motivated by the pictorial structure models introduced by Fischler and Elschlager. The basic idea is to model an object by a collection of parts arranged in a deformable configuration. The appearance ..."
Abstract

Cited by 816 (15 self)
 Add to MetaCart
. The appearance of each part is modeled separately, and the deformable configuration is represented by springlike connections between pairs of parts. These models allow for qualitative descriptions of visual appearance, and are suitable for generic recognition problems. We use these models to address the problem
EndtoEnd Internet Packet Dynamics,”
 Proc. SIGCOMM '97,
, 1997
"... Abstract We discuss findings from a largescale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the endtoend ..."
Abstract

Cited by 843 (19 self)
 Add to MetaCart
" that addresses deficiencies discovered in techniques based on "packet pair"; investigate patterns of packet loss, finding that loss events are not wellmodeled as independent and, furthermore, that the distribution of the duration of loss events exhibits infinite variance; and analyze variations
Grounding in communication
 In
, 1991
"... We give a general analysis of a class of pairs of positive selfadjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator(d2/A2) + x2 on L2(R, dx) and let ..."
Abstract

Cited by 1122 (20 self)
 Add to MetaCart
We give a general analysis of a class of pairs of positive selfadjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator(d2/A2) + x2 on L2(R, dx) and let
A New Statistical Parser Based on Bigram Lexical Dependencies
, 1996
"... This paper describes a new statistical parser which is based on probabilities of dependencies between headwords in the parse tree. Standard bigram probability estimation techniques are extended to calculate probabilities of dependencies between pairs of words. Tests using Wall Street Journal ..."
Abstract

Cited by 490 (4 self)
 Add to MetaCart
This paper describes a new statistical parser which is based on probabilities of dependencies between headwords in the parse tree. Standard bigram probability estimation techniques are extended to calculate probabilities of dependencies between pairs of words. Tests using Wall Street
Extracting patterns and relations from the world wide web
 In WebDB Workshop at 6th International Conference on Extending Database Technology, EDBT’98
, 1998
"... Abstract. The World Wide Web is a vast resource for information. At the same time it is extremely distributed. A particular type of data such as restaurant lists may be scattered across thousands of independent information sources in many di erent formats. In this paper, we consider the problem of e ..."
Abstract

Cited by 471 (1 self)
 Add to MetaCart
of extracting a relation for such a data type from all of these sources automatically. We present a technique which exploits the duality between sets of patterns and relations to grow the target relation starting from a small sample. To test our technique we use it to extract a relation of (author,title) pairs
Efficient algorithms for pairingbased cryptosystems
, 2002
"... We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in larger ch ..."
Abstract

Cited by 367 (24 self)
 Add to MetaCart
We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in larger
A ControlTheoretic Approach to Flow Control
, 1991
"... This paper presents a controltheoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a roundrobinlike queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a ne ..."
Abstract

Cited by 454 (8 self)
 Add to MetaCart
network of such switches. These models motivate the PacketPair rate probing technique, and a provably stable ratebased flow control scheme. A Kalman state estimator is derived from discretetime state space analysis, but there are difficulties in using the estimator in practice. These difficulties
Binary Encoded AttributePairing Technique for Database Compression
"... Data Compression makes for more efficient use of disk space, especially if space is expensive or is limited. It also allows better utilization of bandwidth for transfer of data. For relational databases, however, using standard compression techniques like Gzip or Zip does not take advantage of the r ..."
Abstract
 Add to MetaCart
Data Compression makes for more efficient use of disk space, especially if space is expensive or is limited. It also allows better utilization of bandwidth for transfer of data. For relational databases, however, using standard compression techniques like Gzip or Zip does not take advantage
Results 1  10
of
10,967