241 search results - page 30 / 49 » Graphs, Hypergraphs and Hashing |
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
116
click to vote
COLING
2010
14 years 9 months ago
2010
We present in this paper a formal approach for the representation of multimodal information. This approach, thanks to the to use of typed feature structures and hypergraphs, gener...
ICCAD
2001
IEEE
15 years 10 months ago
2001
IEEE
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...
129
click to vote
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
144
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...