3265 search results - page 29 / 653 » Representing Groups on Graphs |
128
click to vote
EJC
2010
15 years 3 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
124
click to vote
WSE
2003
IEEE
15 years 8 months ago
2003
IEEE
Reverse engineering techniques have the potential to support Web site understanding, by providing views that show the organization of a site and its navigational structure. Howeve...
142
click to vote
JCO
2007
15 years 3 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
139
Voted
CN
2008
15 years 3 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
141
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...