3238 search results - page 226 / 648 » Not Enough Points Is Enough |
160
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
182
click to vote
AAMAS
2005
Springer
15 years 6 months ago
2005
Springer
Communication between agents needs to be flexible enough to encompass together a variety of different aspects such as, conformance to society protocols, private tactics of the indi...
159
click to vote
AML
2005
15 years 6 months ago
2005
Under certain cardinal arithmetic assumptions, we prove that for every large enough regular cardinal, for many regular < , many stationary subsets of concentrating on cofinali...
178
click to vote
ARSCOM
2005
15 years 6 months ago
2005
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of ...
177
click to vote
TCS
2008
15 years 6 months ago
2008
We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as t...