Sciweavers

1605 search results - page 179 / 321
» On Partitional Labelings of Graphs
Sort
View
ESWS
2006
Springer
14 years 2 months ago
Encoding Classifications into Lightweight Ontologies
Classifications have been used for centuries with the goal of cataloguing and searching large sets of objects. In the early days it was mainly books; lately it has also become Web ...
Fausto Giunchiglia, Maurizio Marchese, Ilya Zaihra...
CIVR
2008
Springer
106views Image Analysis» more  CIVR 2008»
14 years 3 days ago
Scalable Markov model-based image annotation
In this paper, we propose a novel Markov model-based formulation for the image annotation problem. In this formulation, we treat image annotation as a graph ranking problem, by de...
Changhu Wang, Lei Zhang, Hong-Jiang Zhang
ALT
2007
Springer
14 years 7 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
MFCS
2005
Springer
14 years 3 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 11 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter