Sciweavers

507 search results - page 53 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
EUROPAR
2003
Springer
14 years 1 months ago
Improving Performance of Hypermatrix Cholesky Factorization
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
José R. Herrero, Juan J. Navarro
SPAA
2004
ACM
14 years 1 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
TNN
1998
254views more  TNN 1998»
13 years 7 months ago
Periodic symmetric functions, serial addition, and multiplication with neural networks
Abstract—This paper investigates threshold based neural networks for periodic symmetric Boolean functions and some related operations. It is shown that any n-input variable perio...
Sorin Cotofana, Stamatis Vassiliadis
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
TCSV
2008
155views more  TCSV 2008»
13 years 7 months ago
Heterogeneous Fusion of Omnidirectional and PTZ Cameras for Multiple Object Tracking
Dual-camera systems have been widely used in surveillance because of the ability to explore the wide field of view (FOV) of the omnidirectional camera and the wide zoom range of th...
Chung-Hao Chen, Yi Yao, David Page, Besma R. Abidi...