Sciweavers

796 search results - page 101 / 160
» Approximating the centroid is hard
Sort
View
TOC
2008
94views more  TOC 2008»
13 years 7 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
PE
2010
Springer
133views Optimization» more  PE 2010»
13 years 6 months ago
Positive Harris recurrence and diffusion scale analysis of a push pull queueing network
We consider a push pull queueing system with two servers and two types of jobs which are processed by the two servers in opposite order, with stochastic generally distributed proc...
Yoni Nazarathy, Gideon Weiss
MOBIHOC
2010
ACM
13 years 5 months ago
On quality of monitoring for multi-channel wireless infrastructure networks
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
Arun Chhetri, Huy Anh Nguyen, Gabriel Scalosub, Ro...
CVPR
2009
IEEE
15 years 2 months ago
Stereo Matching in the Presence of Sub-Pixel Calibration Errors
Stereo matching commonly requires rectified images that are computed from calibrated cameras. Since all under- lying parametric camera models are only approximations, calibratio...
Heiko Hirschmüller, Stefan K. Gehrig
ICCV
2009
IEEE
15 years 20 days ago
Template-Free Monocular Reconstruction of Deformable Surfaces
It has recently been shown that deformable 3D surfaces could be recovered from single video streams. However, ex- isting techniques either require a reference view in which the ...
Aydin Varol, Mathieu Salzmann, Engin Tola, Pascal ...