Sciweavers

25 search results - page 3 / 5
» Fast and Compact Web Graph Representations
Sort
View
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
13 years 11 months ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan
ICIP
2003
IEEE
14 years 7 months ago
Fast similarity search on video signatures
Video signatures are compact representations of video sequences designed for efficient similarity measurement. In this paper, we propose a feature extraction technique to support ...
Sen-Ching S. Cheung, Avideh Zakhor
STRINGOLOGY
2008
13 years 6 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
ICDAR
2009
IEEE
13 years 3 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
ICIP
2001
IEEE
14 years 6 months ago
Video similarity detection with video signature clustering
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
Sen-Ching S. Cheung, Avideh Zakhor