Sciweavers

2988 search results - page 202 / 598
» Experiments with a New Boosting Algorithm
Sort
View
AE
2007
Springer
15 years 10 months ago
A Study of Evaluation Functions for the Graph K-Coloring Problem
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
WAW
2007
Springer
89views Algorithms» more  WAW 2007»
15 years 10 months ago
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet
Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati...
Abraham D. Flaxman, Juan Vera
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
15 years 10 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
PR
2010
184views more  PR 2010»
15 years 3 months ago
Total variation, adaptive total variation and nonconvex smoothly clipped absolute deviation penalty for denoising blocky images
The total variation-based image denoising model has been generalized and extended in numerous ways, improving its performance in different contexts. We propose a new penalty func...
Aditya Chopra, Heng Lian
ICPR
2000
IEEE
15 years 9 months ago
Unsupervised Segmentation of Poisson Data
This paper describes a new approach to the analysis of Poisson point processes, in time (1D) or space (2D), which is based on the minimum description length (MDL) framework. Speci...
Robert D. Nowak, Mário A. T. Figueiredo