2988 search results - page 191 / 598 » Experiments with a New Boosting Algorithm |
130
click to vote
DAGM
2006
Springer
15 years 8 months ago
2006
Springer
Existing methods for segmentation by edgel linking are based on heuristics and give no guarantee for a topologically correct result. In this paper, we propose an edgel linking algo...
123
click to vote
FGCS
2006
15 years 4 months ago
2006
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
194
click to vote
ENDM
2000
15 years 4 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
132
click to vote
TIT
2010
14 years 11 months ago
2010
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
222
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...