Sciweavers

2111 search results - page 7 / 423
» Understanding the Yarowsky Algorithm
Sort
View
EGH
2004
Springer
14 years 2 months ago
Understanding the efficiency of GPU algorithms for matrix-matrix multiplication
Utilizing graphics hardware for general purpose numerical computations has become a topic of considerable interest. The implementation of streaming algorithms, typified by highly ...
Kayvon Fatahalian, Jeremy Sugerman, Pat Hanrahan
INFOCOM
2008
IEEE
14 years 4 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
14 years 4 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
AAAI
2007
14 years 21 days ago
Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
Laurence A. Kramer, Laura Barbulescu, Stephen F. S...