594 search results - page 65 / 119 » Using Approximation to Relate Computational Classes over the... |
JCB
2002
13 years 8 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
ITICSE
2005
ACM
14 years 2 months ago
2005
ACM
Many projects currently used in Software Engineering curricula lack both the “fun factor” needed to engage students, as well as the practical realism of engineering projects t...
TSP
2008
13 years 8 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
ENTCS
2008
13 years 8 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
JCNS
2010
13 years 3 months ago
2010
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...