826 search results - page 133 / 166 » Computational studies using a novel simplicial-approximation... |
POPL
2004
ACM
14 years 29 days ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
BMCBI
2010
13 years 7 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
This paper presents a study of a novel summarization problem called contrastive opinion summarization (COS). Given two sets of positively and negatively opinionated sentences whic...
CVBIA
2005
Springer
14 years 1 months ago
2005
Springer
Registration, that is, the alignment of multiple images, has been one of the most challenging problems in the field of computer vision. It also serves as an important role in biome...