1187 search results - page 75 / 238 » The Generalized Dimensionality Reduction Problem |
CAISE
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...
TSP
2010
14 years 4 months ago
2010
Developing computational models paves the way to understanding, predicting, and influencing the long-term behavior of genomic regulatory systems. However, several major challenges ...
TIT
2008
14 years 9 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
176
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...