1331 search results - page 234 / 267 » Complexity bounds for zero-test algorithms |
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...