1732 search results - page 24 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
131
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
184
click to vote
WDAG
2004
Springer
15 years 11 months ago
2004
Springer
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
157
click to vote
JCT
2007
15 years 5 months ago
2007
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
188
click to vote
TSMC
2008
15 years 4 months ago
2008
This paper explores the issues faced in creating a sys-4 tem that can learn tactical human behavior merely by observing5 a human perform the behavior in a simulation. More specific...
284
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...