1857 search results - page 78 / 372 » Minimum Degree Orderings |
165
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
201
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
138
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
131
click to vote
RTA
2005
Springer
15 years 12 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
173
click to vote
ACIVS
2005
Springer
15 years 12 months ago
2005
Springer
We describe a method for removing quantization artifacts (de-quantizing) in the image domain, by enforcing a high degree of sparseness in its representation with an overcomplete or...