5100 search results - page 986 / 1020 » The Linear Complexity of a Graph |
156
click to vote
NOSSDAV
2009
Springer
15 years 10 months ago
2009
Springer
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
134
click to vote
SSD
2009
Springer
15 years 10 months ago
2009
Springer
A key issue in clustering data, regardless the algorithm used, is the definition of a distance function. In the case of trajectory data, different distance functions have been pro...
136
click to vote
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
163
click to vote
C3S2E
2009
ACM
15 years 10 months ago
2009
ACM
This article introduces Nohalo level 1 (“Nohalo”), the simplest member of a family of image resamplers which straighten diagonal interfaces without adding noticeable nonlinear...
145
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...