467 search results - page 62 / 94 » Roadmap of Infinite Results |
TIT
2008
13 years 10 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
PIMRC
2010
IEEE
13 years 8 months ago
2010
IEEE
An important parameter in determining a spectrum sharing opportunity is the level of interference power that secondary users may generate towards primary users. It is indicated in ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
ECCV
2004
Springer
14 years 12 months ago
2004
Springer
When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the sc...