Sciweavers

1523 search results - page 88 / 305
» The Computational Complexity of Linear Optics
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 3 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
WINE
2009
Springer
147views Economy» more  WINE 2009»
14 years 1 months ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta
VTS
1995
IEEE
94views Hardware» more  VTS 1995»
14 years 13 days ago
Synthesis of locally exhaustive test pattern generators
Optimized locally exhaustive test pattern generators based on linear sums promise a low overhead, but have an irregular structure. The paper presents a new algorithm able to compu...
Günter Kemnitz
VCIP
2001
199views Communications» more  VCIP 2001»
13 years 10 months ago
Estimation of large-amplitude motion and disparity fields: application to intermediate view reconstruction
This paper describes a method for establishing dense correspondence between two images in a video sequence (motion) or in a stereo pair (disparity) in case of large displacements....
Moustapha Kardouchi, Janusz Konrad, Carlos V&aacut...
BMCBI
2007
116views more  BMCBI 2007»
13 years 9 months ago
Linear array of conserved sequence motifs to discriminate protein subfamilies: study on pyridine nucleotide-disulfide reductases
Background: The pyridine nucleotide disulfide reductase (PNDR) is a large and heterogeneous protein family divided into two classes (I and II), which reflect the divergent evoluti...
César L. Avila, Viviana A. Rapisarda, Ricar...