1736 search results - page 311 / 348 » The rank-width of Directed Graphs |
116
click to vote
SISAP
2009
IEEE
15 years 7 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
140
click to vote
PRDC
2009
IEEE
15 years 7 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
137
Voted
ALGOSENSORS
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
121
click to vote
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
122
Voted
SARA
2009
Springer
15 years 7 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...