Sciweavers

2477 search results - page 213 / 496
» Approximate extended formulations
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
Trajectory Segmentation Using Dynamic Programming
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
Richard Mann, Allan D. Jepson, Thomas F. El-Maragh...
ICML
2007
IEEE
16 years 7 months ago
Local dependent components
We introduce a mixture of probabilistic canonical correlation analyzers model for analyzing local correlations, or more generally mutual statistical dependencies, in cooccurring d...
Arto Klami, Samuel Kaski
ICML
2005
IEEE
16 years 7 months ago
A general regression technique for learning transductions
The problem of learning a transduction, that is a string-to-string mapping, is a common problem arising in natural language processing and computational biology. Previous methods ...
Corinna Cortes, Mehryar Mohri, Jason Weston
CADE
2008
Springer
16 years 7 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
ICCAD
2004
IEEE
64views Hardware» more  ICCAD 2004»
16 years 3 months ago
Simultaneous design and placement of multiplexed chemical processing systems on microchips
Microchip structures represent an attractive platform for microscale chemical processing of fluidic systems. However, standardized design methods for these devices have not yet b...
Anton J. Pfeiffer, Tamal Mukherjee, Steinar Hauan