Sciweavers

336 search results - page 54 / 68
» Relevance heuristics for program analysis
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
JIIS
2008
89views more  JIIS 2008»
13 years 7 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
JPDC
2008
122views more  JPDC 2008»
13 years 7 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
MANSCI
2007
100views more  MANSCI 2007»
13 years 7 months ago
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Companies such as Zara and World Co. have recently implemented novel product development processes and supply chain architectures enabling them to make more product design and ass...
Felipe Caro, Jérémie Gallien
MP
2010
94views more  MP 2010»
13 years 6 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi