799 search results - page 141 / 160 » Handling Dynamic Schema Change in Process Models |
125
click to vote
CCO
2001
Springer
15 years 6 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
114
Voted
BMCBI
2006
15 years 1 months ago
2006
Background: Evolutionary genomics requires management and filtering of large numbers of diverse genomic sequences for accurate analysis and inference on evolutionary processes of ...
110
click to vote
RTAS
2003
IEEE
15 years 7 months ago
2003
IEEE
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
134
click to vote
ICIP
2008
IEEE
16 years 3 months ago
2008
IEEE
We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incohe...
107
Voted
ICIP
2002
IEEE
16 years 3 months ago
2002
IEEE
For almost a decade, Content-Based Image Retrieval has been an active research area, yet one fundamental problem remains largely unsolved: how to measure perceptual similarity. To...