Sciweavers

2127 search results - page 158 / 426
» Computing large matchings fast
Sort
View
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 11 months ago
Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
Radim Rehurek
ICPR
2010
IEEE
15 years 11 months ago
Motion-Sketch Based Video Retrieval Using a Trellis Levenshtein Distance
We present a fast technique for retrieving video clips using free-hand sketched queries. Visual keypoints within each video are detected and tracked to form short trajectories, wh...
Rui Hu, John Philip Collomosse
ICIAP
2007
ACM
16 years 4 months ago
A High Performance Exact Histogram Specification Algorithm
Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accu...
Alessandro Bevilacqua, Pietro Azzari
157
Voted
MOBIDE
2003
ACM
15 years 9 months ago
Semantically driven service interoperability for pervasive computing
The common vision of pervasive computing environments requires a very large range of devices and software components to interoperate seamlessly. From the assumption that these dev...
Declan O'Sullivan, David Lewis
ACMACE
2005
ACM
15 years 9 months ago
Possession techniques for interaction in real-time strategy augmented reality games
There have been a number of interactive games created for Augmented Reality (AR) environments. In this paper, interaction techniques to support Real-Time Strategy (RTS) games in A...
Keith Phillips, Wayne Piekarski