1538 search results - page 185 / 308 » Spectral Techniques in Graph Algorithms |
112
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
157
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
109
click to vote
DAM
2007
15 years 1 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
112
Voted
JMLR
2006
15 years 1 months ago
2006
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
133
Voted
CODES
2010
IEEE
14 years 11 months ago
2010
IEEE
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...