2738 search results - page 193 / 548 » The Frobenius Problem and Its Generalizations |
188
click to vote
ARC
2010
Springer
15 years 11 months ago
2010
Springer
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
123
click to vote
APPT
2007
Springer
15 years 11 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
135
click to vote
ECML
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
146
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— High-level specification of how the brain represents and categorizes the causes of its sensory input allows to link “what is to be done” (perceptual task) with “...
136
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...