Sciweavers

57 search results - page 10 / 12
» Bead-Sort: A Natural Sorting Algorithm
Sort
View
SIGCOMM
1994
ACM
13 years 11 months ago
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers
An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an inno...
Charles E. Perkins, Pravin Bhagwat
AUSAI
2008
Springer
13 years 9 months ago
Additive Regression Applied to a Large-Scale Collaborative Filtering Problem
Abstract. The much-publicized Netflix competition has put the spotlight on the application domain of collaborative filtering and has sparked interest in machine learning algorithms...
Eibe Frank, Mark Hall
JMLR
2008
148views more  JMLR 2008»
13 years 7 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
PRL
2008
65views more  PRL 2008»
13 years 7 months ago
Matching of quasi-periodic time series patterns by exchange of block-sorting signatures
We propose a novel method for quasi-periodic time series patterns matching, through signature exchange between the two patterns. The signature is obtained through sorting of the t...
Bachir Boucheham
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick