540 search results - page 105 / 108 » New bounds on the edge number of a k-map graph |
182
click to vote
PODS
2009
ACM
16 years 8 days ago
2009
ACM
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
TVCG
2008
14 years 11 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...
109
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains connections with a nu...
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
SAT
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...