2780 search results - page 60 / 556 » Generalizing by Removing Detail |
165
click to vote
LREC
2008
15 years 8 months ago
2008
Web count statistics gathered from search engines have been widely used as a resource in a variety of NLP tasks. For some tasks, however, the information they exploit is not fine-...
155
click to vote
JNSM
2006
15 years 6 months ago
2006
Two bounds on network coding rates are reviewed that generalize edge-cut bounds on routing rates. The simpler bound is a bidirected cut-set bound which generalizes and improves upo...
237
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
189
click to vote
VIS
2004
IEEE
16 years 7 months ago
2004
IEEE
Noise reduction is an important preprocessing step for many visualization techniques that make use of feature extraction. We propose a method for denoising 2-D vector fields that ...
215
click to vote
AGILE
2009
Springer
16 years 1 months ago
2009
Springer
The problem of line simplification is a recurrent problem in cartography. The purpose is to remove irrelevant details while emphasising the main features of the line. Most of the ...