Sciweavers

42 search results - page 7 / 9
» Approximate embedding-based subsequence matching of time ser...
Sort
View
142
Voted
COCOA
2009
Springer
15 years 10 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
134
Voted
ICPR
2008
IEEE
15 years 10 months ago
Using SIFT features in palmprint authentication
As a new branch of biometrics, palmprint authentication has attracted increasing amount of attention because palmprints are abundant of line features so that low resolution images...
Jiansheng Chen, Yiu Sang Moon
127
Voted
AIRS
2004
Springer
15 years 9 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
138
Voted
ICIP
2005
IEEE
16 years 5 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
103
Voted
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 9 months ago
Expressive negotiation over donations to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
Vincent Conitzer, Tuomas Sandholm