Sciweavers

620 search results - page 33 / 124
» The edge-flipping group of a graph
Sort
View
DM
2008
112views more  DM 2008»
15 years 6 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
EJC
2007
15 years 6 months ago
The homology of the cycle matroid of a coned graph
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
Woong Kook
ICML
2010
IEEE
15 years 7 months ago
Online Learning for Group Lasso
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
Haiqin Yang, Zenglin Xu, Irwin King, Michael R. Ly...
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
16 years 26 days ago
Exploring Group Moving Pattern for an Energy-Constrained Object Tracking Sensor Network
In this paper, we investigate and utilize the characteristic of the group movement of objects to achieve energy conservation in the inherently resource-constrained wireless object ...
Hsiao-Ping Tsai, De-Nian Yang, Wen-Chih Peng, Ming...
FSTTCS
2009
Springer
16 years 1 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov