239 search results - page 31 / 48 » Hardness and algorithms for rainbow connection |
109
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Form mapping is the key problem that needs to be solved in order to get access to the hidden web. Currently available solutions for fully automatic mapping are not ready for comme...
104
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
113
click to vote
ISBI
2006
IEEE
15 years 7 months ago
2006
IEEE
The relationship between brain structure and complex behavior is governed by large-scale neurocognitive networks. Diffusion weighted imaging(DWI) is a noninvasive technique that c...
119
click to vote
GLVLSI
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper we develop a theory of equivalence checking (EC) and logic synthesis of circuits with a common specification (CS). We show that two combinational circuits N1, N2 have...
100
Voted
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...