Results 1  10
of
69,846
Analysis of Recommendation Algorithms for ECommerce
, 2000
"... Recommender systems apply statistical and knowledge discovery techniques to the problem of making product recommendations during a live customer interaction and they are achieving widespread success in ECommerce nowadays. In this paper, we investigate several techniques for analyzing largescale pu ..."
Abstract

Cited by 523 (22 self)
 Add to MetaCart
scale purchase and preference data for the purpose of producing useful recommendations to customers. In particular, we apply a collection of algorithms such as traditional data mining, nearestneighbor collaborative ltering, and dimensionality reduction on two dierent data sets. The rst data set was derived from
Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms
 IEEE Transactions on Image Processing
, 1993
"... Morphological reconstruction is part of a set of image operators often referred to as geodesic. In the binary case, reconstruction simply extracts the connected components of a binary image I (the mask) which are \marked " by a (binary) image J contained in I. This transformation can be ext ..."
Abstract

Cited by 336 (3 self)
 Add to MetaCart
Morphological reconstruction is part of a set of image operators often referred to as geodesic. In the binary case, reconstruction simply extracts the connected components of a binary image I (the mask) which are \marked " by a (binary) image J contained in I. This transformation can
On the complexity of multiple sequence alignment
 J. Comp. Biol
, 1994
"... We study the computational complexity oftwo popular problems in multiple sequence alignment: multiple alignment with SPscore and multiple tree alignment. It is shown that the rst problem is NPcomplete and the second is MAX SNPhard. The complexity of tree alignment with a given phylogeny is also c ..."
Abstract

Cited by 328 (12 self)
 Add to MetaCart
We study the computational complexity oftwo popular problems in multiple sequence alignment: multiple alignment with SPscore and multiple tree alignment. It is shown that the rst problem is NPcomplete and the second is MAX SNPhard. The complexity of tree alignment with a given phylogeny is also
Algorithms for Inverse Reinforcement Learning
 in Proc. 17th International Conf. on Machine Learning
, 2000
"... This paper addresses the problem of inverse reinforcement learning (IRL) in Markov decision processes, that is, the problem of extracting a reward function given observed, optimal behaviour. IRL may be useful for apprenticeship learning to acquire skilled behaviour, and for ascertaining the re ..."
Abstract

Cited by 314 (6 self)
 Add to MetaCart
the reward function being optimized by a natural system. We rst characterize the set of all reward functions for which a given policy is optimal. We then derive three algorithms for IRL. The rst two deal with the case where the entire policy is known; we handle tabulated reward functions on a nite
The Fast Construction of Extension Velocities in Level Set Methods
 Journal of Computational Physics
, 1997
"... Level set techniques are numerical techniques for tracking the evolution of interfaces. They rely on two central embeddings; rst the embedding of the interface as the zero level set of a higher dimensional function, and second, the embedding (or extension) of the interface's velocity to this hi ..."
Abstract

Cited by 218 (12 self)
 Add to MetaCart
Level set techniques are numerical techniques for tracking the evolution of interfaces. They rely on two central embeddings; rst the embedding of the interface as the zero level set of a higher dimensional function, and second, the embedding (or extension) of the interface's velocity
LexRank: Graphbased lexical centrality as salience in text summarization
 Journal of Artificial Intelligence Research
, 2004
"... We introduce a stochastic graphbased method for computing relative importance of textual units for Natural Language Processing. We test the technique on the problem of Text Summarization (TS). Extractive TS relies on the concept of sentence salience to identify the most important sentences in a doc ..."
Abstract

Cited by 266 (9 self)
 Add to MetaCart
document or set of documents. Salience is typically dened in terms of the presence of particular important words or in terms of similarity to a centroid pseudosentence. We consider a new approach, LexRank, for computing sentence importance based on the concept of eigenvector centrality in a graph
The local power of some unit root tests for panel data
 Advances in Econometrics, Vol. 15: Nonstationary Panels, Panel Cointegration, and Dynamic Panels, JAI
, 2000
"... To test the hypothesis of a di erence stationary time series against a trend stationary alternative, Levin and Lin (1993) and Im, Pesaran and Shin (1997) suggest bias adjusted tstatistics. Such corrections are necessary to account for the nonzero mean of the tstatistic in the case of an OLS detren ..."
Abstract

Cited by 250 (2 self)
 Add to MetaCart
detrending method. In this paper the local power of panel unit root statistics against a sequence of local alternatives is studied. It is shown that the local power of the test statistics is a ected by two di erent terms. The rst term represents the asymptotic e ect on the bias due the detrending method
A Simple Algorithm for Homeomorphic Surface Reconstruction
 International Journal of Computational Geometry and Applications
, 2000
"... The problem of computing a piecewise linear approximation to a surface from a set of sample points is important in solid modeling, computer graphics and computer vision. A recent algorithm [1] using the Voronoi diagram of the sample points gave a guarantee on the distance of the output surface from ..."
Abstract

Cited by 233 (29 self)
 Add to MetaCart
The problem of computing a piecewise linear approximation to a surface from a set of sample points is important in solid modeling, computer graphics and computer vision. A recent algorithm [1] using the Voronoi diagram of the sample points gave a guarantee on the distance of the output surface from
Detecting SYN Flooding Attacks
 In Proceedings of the IEEE Infocom
, 2002
"... We propose a simple and robust mechanism for detecting SYN flooding attacks. Instead of monitoring the ongoing traffic at the front end (like firewall or proxy) or a victim server itself, we detect the SYN flooding attacks at leaf routers that connect end hosts to the Internet. The simplicity of our ..."
Abstract

Cited by 215 (8 self)
 Add to MetaCart
of our detection mechanism lies in its statelessness and low computation overhead, which make the detection mechanism itself immune to flooding attacks. Our detection mechanism is based on the protocol behavior of TCP SYNFIN (RST) pairs, and is an instance of the Sequential Change Point Detection [1
Results 1  10
of
69,846