Sciweavers

2382 search results - page 284 / 477
» Generating Seeded Trees from Data Sets
Sort
View
AIA
2006
15 years 21 days ago
Efficient Algorithm for Calculating Similarity between Trajectories Containing an Increasing Dimension
Time series data is usually stored and processed in the form of discrete trajectories of multidimensional measurement points. In order to compare the measurements of a query traje...
Perttu Laurinen, Pekka Siirtola, Juha Röning
ICDAR
2009
IEEE
14 years 9 months ago
Stochastic Segment Modeling for Offline Handwriting Recognition
In this paper, we present a novel approach for incorporating structural information into the hidden Markov Modeling (HMM) framework for offline handwriting recognition. Traditiona...
Premkumar Natarajan, Krishna Subramanian, Anurag B...
IPPS
2007
IEEE
15 years 5 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
CCGRID
2008
IEEE
15 years 5 months ago
A Stable Broadcast Algorithm
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenji...
STACS
2001
Springer
15 years 3 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid