Sciweavers

724 search results - page 118 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
16 years 3 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong
FPL
2006
Springer
112views Hardware» more  FPL 2006»
15 years 6 months ago
Real-Time Video Pixel Matching
We present an efficient implementation of a state of the art algorithm PixelMatch for matching all pixels within consecutive video frames. The method is of practical interest for ...
Jean-Baptiste Note, Mark Shand, Jean Vuillemin
FPL
2008
Springer
178views Hardware» more  FPL 2008»
15 years 4 months ago
High-speed regular expression matching engine using multi-character NFA
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kam...
CVPR
2006
IEEE
16 years 5 months ago
AnnoSearch: Image Auto-Annotation by Search
Although it has been studied for several years by computer vision and machine learning communities, image annotation is still far from practical. In this paper, we present AnnoSea...
Xin-Jing Wang, Lei Zhang, Feng Jing, Wei-Ying Ma
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 3 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer