2621 search results - page 460 / 525 » Generalized Algorithms for Constructing Statistical Language... |
CTCS
1989
Springer
13 years 11 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
SMA
2005
ACM
14 years 1 months ago
2005
ACM
Constructing splines whose parametric domain is an arbitrary manifold and effectively computing such splines in realworld applications are of fundamental importance in solid and ...
37
Voted
EUROSYS
2006
ACM
14 years 4 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
BMCBI
2007
13 years 7 months ago
2007
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...