2612 search results - page 327 / 523 » Switching Graphs and Their Complexity |
150
Voted
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
147
click to vote
ISCIS
2005
Springer
15 years 10 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
127
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
138
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory...
121
click to vote
JAIR
2008
15 years 4 months ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...