Sciweavers

440 search results - page 79 / 88
» Comparison of Galled Trees
Sort
View
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 8 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
CVPR
2009
IEEE
15 years 3 months ago
Vocabulary Hierarchy Optimization for Effective and Transferable Retrieval
Scalable image retrieval systems usually involve hierarchical quantization of local image descriptors, which produces a visual vocabulary for inverted indexing of images. Although ...
Rongrong Ji (Harbin Institute of Technology), Xing...
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 8 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
ECCV
2008
Springer
14 years 6 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 3 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou