Sciweavers

16404 search results - page 2423 / 3281
» A set coverage problem
Sort
View
COMPGEOM
2010
ACM
16 years 20 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen

Publication
420views
17 years 6 months ago
Adaptive Multilevel Early Congestion Notification
We propose Adaptive Multi-level ECN, a new TCP congestion scheme as an extension to Multi-level Explicit Congestion Notification (MECN). MECN algo- rithm allows network operators t...
A. Durresi, M. Sridharan, Raj Jain
CVPR
2009
IEEE
1866views Computer Vision» more  CVPR 2009»
17 years 2 months ago
Understanding and evaluating blind deconvolution algorithms
Blind deconvolution is the recovery of a sharp version of a blurred image when the blur kernel is unknown. Recent algorithms have afforded dramatic progress, yet many aspects of...
Anat Levin, Yair Weiss, Frédo Durand, Willi...
CVPR
2009
IEEE
17 years 2 months ago
StaRSaC: Stable Random Sample Consensus for Parameter Estimation
We address the problem of parameter estimation in presence of both uncertainty and outlier noise. This is a common occurrence in computer vision: feature localization is perform...
Jongmoo Choi, Gérard G. Medioni
CVPR
2009
IEEE
17 years 2 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
« Prev « First page 2423 / 3281 Last » Next »