Sciweavers

278 search results - page 39 / 56
» Constraint Models for the Covering Test Problem
Sort
View
SAC
2003
ACM
14 years 25 days ago
A Markov Random Field Model of Microarray Gridding
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...
Mathias Katzer, Franz Kummert, Gerhard Sagerer
ICPR
2004
IEEE
14 years 8 months ago
Discriminative Distance Measures for Image Matching
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...
Tat-Jen Cham, Xi Chen
ACSD
2003
IEEE
103views Hardware» more  ACSD 2003»
14 years 26 days ago
Design Validation of ZCSP with SPIN
— We consider the problem of specifying a model of the Zero Copy Secured Protocol for the purpose of LTL verification with the SPIN Model Checker. ZCSP is based on Direct Memory...
Vincent Beaudenon, Emmanuelle Encrenaz, Jean Lou D...
NIPS
2007
13 years 9 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
INFOCOM
1995
IEEE
13 years 11 months ago
Degree-Constrained Multicasting in Point-to-Point Networks
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
Fred Bauer, Anujan Varma