492 search results - page 80 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
BIRTHDAY
2009
Springer
15 years 5 months ago
2009
Springer
We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
112
click to vote
MIS
2001
Springer
15 years 3 months ago
2001
Springer
Multimedia databases deal with storage and retrieval of complex descriptors of image contents, called features. Traditional techniques consider features as “black boxes,” ofte...
DSD
2010
IEEE
14 years 8 months ago
2010
IEEE
We present a high-level synthesis flow for mapping an algorithm description (in C) to a provably equivalent registertransfer level (RTL) description of hardware. This flow uses an ...
106
click to vote
BMCBI
2006
14 years 10 months ago
2006
Background: In order to improve gene prediction, extrinsic evidence on the gene structure can be collected from various sources of information such as genome-genome comparisons an...