1199 search results - page 153 / 240 » Graph Theory |
151
click to vote
CSR
2009
Springer
15 years 5 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
166
click to vote
DBSEC
2009
15 years 5 months ago
2009
With the rapid growth in wireless networks and sensor and mobile devices, we are moving towards an era of pervasive computing. Access control is challenging in these environments. ...
123
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
122
Voted
JGT
2008
15 years 3 months ago
2008
Abstract: In any r-uniform hypergraph H for 2 t r we define an runiform t-tight Berge-cycle of length , denoted by C(r,t) , as a sequence of distinct vertices v1, v2, . . . , v ,...
135
click to vote
AC
2004
Springer
15 years 3 months ago
2004
Springer
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by auto...