Sciweavers

3359 search results - page 485 / 672
» A Simplified Idea Algorithm
Sort
View
MDM
2010
Springer
152views Communications» more  MDM 2010»
14 years 3 months ago
Finding One-Of Probably Nearest Neighbors with Minimum Location Updates
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
Mitzi McCarthy, Xiaoyang Sean Wang, Zhen He
DSRT
2008
IEEE
14 years 15 days ago
RTPROC: A System for Rapid Real-Time Prototyping in Audio Signal Processing
In this contribution a new system for the rapid development of real-time prototypes for digital audio signal processing algorithms on Windows PCs and a Digital Signal Processor (D...
Hauke Krüger, Peter Vary
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
14 years 5 days ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
EUROGRAPHICS
2010
Eurographics
13 years 12 months ago
Contrast-aware Halftoning
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
Hua Li and David Mould
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 10 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...