2125 search results - page 259 / 425 » On Graph Complexity |
119
click to vote
ICNP
2007
IEEE
15 years 9 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
134
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
114
Voted
TVCG
2008
15 years 2 months ago
2008
Abstract-- A typical data-driven visualization of electroencephalography (EEG) coherence is a graph layout, with vertices representing electrodes and edges representing significant...
148
click to vote
HICSS
2003
IEEE
15 years 8 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
137
click to vote
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...