Sciweavers

3265 search results - page 160 / 653
» Representing Groups on Graphs
Sort
View
DM
2002
86views more  DM 2002»
15 years 3 months ago
A chip-firing game and Dirichlet eigenvalues
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
Fan R. K. Chung, Robert B. Ellis
ICCV
2011
IEEE
14 years 4 months ago
Object Detection and Segmentation from Joint Embedding of Parts and Pixels
We present a new framework in which image segmentation, figure/ground organization, and object detection all appear as the result of solving a single grouping problem. This frame...
Michael Maire, Stella X. Yu, Pietro Perona
ENTCS
2008
153views more  ENTCS 2008»
15 years 3 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
ISI
2007
Springer
15 years 10 months ago
Organizing Hot-Spot Police Patrol Routes
—We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using ...
Sudarshan S. Chawathe
ANTSW
2004
Springer
15 years 9 months ago
Ants Can Play Music
In this paper, we describe how we can generate music by simulating moves of artificial ants on a graph where vertices represent notes and edges represent possible transitions betw...
Christophe Guéret, Nicolas Monmarché...