Sciweavers

1749 search results - page 126 / 350
» Conditional colorings of graphs
Sort
View
PAMI
2010
351views more  PAMI 2010»
15 years 5 months ago
Evaluating Color Descriptors for Object and Scene Recognition
—Image category recognition is important to access visual information on the level of objects and scene types. So far, intensity-based descriptors have been widely used for featu...
Koen E. A. van de Sande, Theo Gevers, Cees G. M. S...
ADC
2008
Springer
110views Database» more  ADC 2008»
16 years 27 days ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
GD
1999
Springer
15 years 10 months ago
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
DM
2008
86views more  DM 2008»
15 years 6 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner
PEPM
2010
ACM
16 years 3 months ago
Conditional weighted pushdown systems and applications
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...
Xin Li, Mizuhito Ogawa