نتایج جستجو برای: pairwise constraints

تعداد نتایج: 205768  

Journal: :Signal Processing 2014
Mohammad Javad Taghizadeh Philip N. Garner Hervé Bourlard

In this paper, we investigate the diffuse field coherence model for microphone array pairwise distance estimation. We study the fundamental constraints and assumptions underlying this approach and propose evaluation methodologies to measure the adequacy of diffuseness for microphone array calibration. In addition, an enhanced scheme based on coherence averaging and histogramming, is presented t...

2017
Trang-Anh Nghiem Olivier Marre Alain Destexhe Ulisse Ferrari

During wakefulness and deep sleep brain states, cortical neural networks show a different behavior, with the second characterized by transients of high network activity. To investigate their impact on neuronal behavior, we apply a pairwise Ising model analysis by inferring the maximum entropy model that reproduces single and pairwise moments of the neuron’s spiking activity. In this work we fir...

Journal: :TPLP 2010
Henning Christiansen Christian Theil Have Ole Torp Lassen Matthieu Petit

A Hidden Markov Model (HMM) is a common statistical model which is widely used for analysis of biological sequence data and other sequential phenomena. In the present paper we show how HMMs can be extended with side-constraints and present constraint solving techniques for efficient inference. Defining HMMs with side-constraints in Constraint Logic Programming has advantages in terms of more co...

2007
Joao Marques-Silva Inês Lynce

Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are the different SAT encodings for ≤ 1 (x1, . . . , xn) constraints. The most widely used encoding is known as the pairwise encoding, which is quadratic in the number of variables in the constraint. Alternative encodings ar...

2006
Jing Lu

Virtualization has been proposed as a vehicle for overcoming the growing problem of internet ossification [1]. This paper studies the problem of mapping diverse virtual networks onto a common physical substrate. In particular, we develop a method for mapping a virtual network onto a substrate network in a cost-efficient way, while allocating sufficient capacity to virtual network links to ensur...

2017
Adam J. Riesselman John B. Ingraham Debora S. Marks

The functions of proteins and RNAs are determined by a myriad of interactions between their constituent residues, but most quantitative models of how molecular phenotype depends on genotype must approximate this by simple additive effects. While recent models have relaxed this constraint to also account for pairwise interactions, these approaches do not provide a tractable path towards modeling...

2014
Arnold Polanski Fernando Vega-Redondo

The paper proposes an intertemporal model of bargaining among heterogeneous buyers and sellers placed on an endogenous bipartite network. First, we characterize those networks whose trading restrictions are non-binding in that the induced outcome is “arbitrage-free,” i.e. all trade is conducted at the same price. Second, we assume that the network is endogenously determined, as captured by the ...

Journal: :TIIS 2014
Menglin Wu Qiang Chen Quan-Sen Sun

Relevance feedback is an effective tool to bridge the gap between superficial image contents and medically-relevant sense in content-based medical image retrieval. In this paper, we propose an interactive medical image search framework based on pairwise constraint propagation. The basic idea is to obtain pairwise constraints from user feedback and propagate them to the entire image set to recon...

Journal: :JNW 2014
Kun Mu Li Li

Key management plays fundamental role in research on security service in wireless sensor networks (WSNs). However, due to the resource constraints, establishing pairwise keys in WSNs is not a trivial tasks. Several exiting key management schemes have been proposed in literature to establish pairwise keys between sensor nodes, but they either can not offer strong resilience against node capture ...

2001
Venu Madhav Govindu

In this paper we describe two methods for estimating the motion parameters of an image sequence. For a sequence of images, the global motion can be described by independent motion models. On the other hand, in a sequence there exist as many as pairwise relative motion constraints that can be solve for efficiently. In this paper we show how to linearly solve for consistent global motion models u...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید