Sciweavers

6266 search results - page 66 / 1254
» New results on the computability and complexity of points - ...
Sort
View
ANCS
2005
ACM
14 years 2 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
SMI
2010
IEEE
188views Image Analysis» more  SMI 2010»
13 years 7 months ago
Sharp Feature Detection in Point Clouds
—This paper presents a new technique for detecting sharp features on point-sampled geometry. Sharp features of different nature and possessing angles varying from obtuse to acute...
Christopher Weber, Stefanie Hahmann, Hans Hagen
COMPGEOM
2004
ACM
14 years 2 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
ECCV
2008
Springer
14 years 10 months ago
An Extended Phase Field Higher-Order Active Contour Model for Networks and Its Application to Road Network Extraction from VHR S
This paper addresses the segmentation from an image of entities that have the form of a `network', i.e. the region in the image corresponding to the entity is composed of bran...
Ian H. Jermyn, Josiane Zerubia, Ting Peng, V&eacut...
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 9 months ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel