358 search results - page 54 / 72 » Sparse squares of polynomials |
MST
2010
14 years 7 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
109
click to vote
ICANNGA
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
BIOINFORMATICS
2006
14 years 9 months ago
2006
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
WADS
1995
Springer
15 years 1 months ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
77
Voted
JSAC
2008
14 years 9 months ago
2008
We propose in this work a single copy and multi-hop opportunistic routing scheme for sparse delay tolerant networks (DTNs). The scheme uses as only input the estimates of the avera...