195 search results - page 16 / 39 » Cluster-based find and replace |
COMPSAC
2004
IEEE
13 years 10 months ago
2004
IEEE
Many developers who could benefit from building and analysing formal models of their systems are deterred from doing so by the process algebra style input languages of formal mode...
AAAI
2008
13 years 9 months ago
2008
Matrix factorization algorithms are frequently used in the machine learning community to find low dimensional representations of data. We introduce a novel generative Bayesian pro...
NIPS
2004
13 years 8 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
ICANN
2010
Springer
13 years 7 months ago
2010
Springer
So-called Physical Unclonable Functions are an emerging, new cryptographic and security primitive. They can potentially replace secret binary keys in vulnerable hardware systems an...
ALGORITHMICA
2008
13 years 6 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...