Sciweavers

2654 search results - page 118 / 531
» On Pairing Inversion Problems
Sort
View
128
Voted
FOCS
1998
IEEE
15 years 9 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
132
Voted
SIAMREV
2011
61views more  SIAMREV 2011»
14 years 7 months ago
The Mathematics of Atmospheric Dispersion Modeling
The Gaussian plume model is a standard approach for studying the transport of airborne contaminants due to turbulent diffusion and advection by the wind. This paper reviews the as...
John M. Stockie
COCOA
2007
Springer
15 years 11 months ago
Steiner Forests on Stochastic Metric Graphs
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
LREC
2008
74views Education» more  LREC 2008»
15 years 6 months ago
Building Bilingual Lexicons using Lexical Translation Probabilities via Pivot Languages
This paper proposes a method of increasing the size of a bilingual lexicon obtained from two other bilingual lexicons via a pivot language. When we apply this approach, there are ...
Takashi Tsunakawa, Naoaki Okazaki, Jun-ichi Tsujii
ICIP
2008
IEEE
15 years 11 months ago
Blind deconvolution of video sequences
We present a new blind deconvolution method for video sequence. It is derived following an inverse problem approach in a Bayesian framework. This method exploits the temporal cont...
Ferreol Soulez, Eric Thiebaut, Yves Tourneur, Alai...