Sciweavers

807 search results - page 109 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
136
Voted
TON
2008
109views more  TON 2008»
15 years 3 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
ECCV
2008
Springer
16 years 5 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
ICPR
2002
IEEE
15 years 8 months ago
A Large Scale Clustering Scheme for Kernel K-Means
Kernel functions can be viewed as a non-linear transformation that increases the separability of the input data by mapping them to a new high dimensional space. The incorporation ...
Rong Zhang, Alexander I. Rudnicky
164
Voted
SSPR
2004
Springer
15 years 9 months ago
Optimizing Classification Ensembles via a Genetic Algorithm for a Web-Based Educational System
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
Behrouz Minaei-Bidgoli, Gerd Kortemeyer, William F...
185
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park