Sciweavers

2523 search results - page 76 / 505
» Objective: In Minimum Context
Sort
View
DCG
2010
137views more  DCG 2010»
14 years 10 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
JC
2002
63views more  JC 2002»
14 years 9 months ago
On the Complexity of Exclusion Algorithms for Optimization
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
Eugene L. Allgower, Melissa Erdmann, Kurt Georg
ICIP
2003
IEEE
15 years 11 months ago
Robust object boundary determination using a locally adaptive level set algorithm
This paper introduces a level set methodology for the precise boundary localization of image objects within an indicated region, designed to be particularly robust against weak or...
Eftychios Sifakis, George Tziritas
TIT
2011
119views more  TIT 2011»
14 years 5 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
CGI
1998
IEEE
15 years 2 months ago
Illumination Dependent Refinement of Multiresolution Meshes
State of the art multiresolution modeling allows to selectively refine a coarse mesh of an object on the visually important parts. In this way it is possible to render the geometr...
Andreas Schilling, Reinhard Klein, Wolfgang Stra&s...