Sciweavers

2780 search results - page 259 / 556
» Effective features of algorithm visualizations
Sort
View
CIKM
2010
Springer
15 years 4 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
CVPR
2008
IEEE
16 years 8 months ago
Modeling complex luminance variations for target tracking
Lambert's model is widely used in low level computer vision algorithms such as matching, tracking or optical flow computation for example. However, it is well known that thes...
Éric Marchand, Christophe Collewet
CAV
2009
Springer
157views Hardware» more  CAV 2009»
16 years 7 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 6 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
ICMCS
2006
IEEE
82views Multimedia» more  ICMCS 2006»
16 years 20 days ago
Block-based Fast Compression for Compound Images
—This paper presents a novel block-based fast compression (BFC) algorithm for compound images that contain graphics, text and natural images. The images are divided to blocks, wh...
Wenpeng Ding, Dong Liu, Yuwen He, Feng Wu