Sciweavers

197 search results - page 18 / 40
» Some Topological Methods in Graph Coloring Theory
Sort
View
ICIP
2009
IEEE
14 years 6 months ago
Edge-preserving Colorization using Data-Driven Random Walks with Restart
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
Tae Hoon Kim (Seoul National University), Kyoung M...
COMPGEOM
2006
ACM
14 years 2 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
TVCG
2008
145views more  TVCG 2008»
13 years 8 months ago
Geometry-Based Edge Clustering for Graph Visualization
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
Weiwei Cui, Hong Zhou, Huamin Qu, Pak Chung Wong, ...
ATAL
2006
Springer
14 years 6 days ago
Structural evaluation of agent organizations
A multi-agent system can be analyzed and specified as an organization consisting of roles and their relations. The performance of an organization depends on many factors among whi...
Davide Grossi, Frank Dignum, Virginia Dignum, Mehd...
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
14 years 5 months ago
Structure and Dynamics of Research Collaboration in Computer Science.
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
Andre Nash, Christian Bird, Earl T. Barr, Premkuma...