Sciweavers

5115 search results - page 378 / 1023
» On Randomized Lanczos Algorithms
Sort
View
127
Voted
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 7 months ago
Computing Minimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
Max Neunhöffer, Cheryl E. Praeger
COMGEO
2004
ACM
15 years 7 months ago
Speeding up the incremental construction of the union of geometric objects in practice
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
Eti Ezra, Dan Halperin, Micha Sharir
JCB
2002
160views more  JCB 2002»
15 years 7 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
INFOCOM
2012
IEEE
13 years 10 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang
CVPR
2012
IEEE
13 years 10 months ago
Learning features on robotic surgical tools
Computer-aided surgical interventions in both manual and robotic procedures have been shown to improve patient outcomes and enhance the skills of the human physician. Tool trackin...
Austin Reiter, Peter K. Allen, Tao Zhao