Sciweavers

3708 search results - page 283 / 742
» Approximating Betweenness Centrality
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 10 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
DATE
2004
IEEE
108views Hardware» more  DATE 2004»
15 years 10 months ago
Poor Man's TBR: A Simple Model Reduction Scheme
This paper presents a model reduction algorithm motivated by a connection between frequency domain projection methods and approximation of truncated balanced realizations. The met...
Joel R. Phillips, Luis Miguel Silveira
FCCM
2006
IEEE
138views VLSI» more  FCCM 2006»
15 years 10 months ago
Efficient Hardware Generation of Random Variates with Arbitrary Distributions
This paper presents a technique for efficiently generating random numbers from a given probability distribution. This is achieved by using a generic hardware architecture, which t...
David B. Thomas, Wayne Luk
ICRA
1995
IEEE
91views Robotics» more  ICRA 1995»
15 years 10 months ago
Three-Dimensional Model Construction from Multiple Sensor Viewpoints
2 Multi-view Integration: A Review We address the problem of constructing a boundary model of an object when the input consists of a set of points that lie on its surface. We assum...
Stéphane Aubry, Vincent Hayward
CCCG
2008
15 years 8 months ago
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
A. Karim Abu-Affash, Matthew J. Katz