Sciweavers

19866 search results - page 256 / 3974
» Computing all factorizations in ***
Sort
View
FCCM
2000
IEEE
133views VLSI» more  FCCM 2000»
15 years 11 months ago
Configuration Caching Management Techniques for Reconfigurable Computing
Although run-time reconfigurable systems have been shown to achieve very high performance, the speedups over traditional microprocessor systems are limited by the cost of configur...
Zhiyuan Li, Katherine Compton, Scott Hauck
HCI
2007
15 years 8 months ago
Reminders, Alerts and Pop-ups: The Cost of Computer-Initiated Interruptions
Responding to computer-initiated notifications requires a shift in attention that disrupts the flow of work. The degree of cost associated with resuming the original task following...
Helen M. Hodgetts, Dylan M. Jones
JMIV
2000
143views more  JMIV 2000»
15 years 6 months ago
A Linear Algorithm for Computing the Homography from Conics in Correspondence
Abstract. This paper presents a study, based on conic correspondences, on the relationship between two perspective images acquired by an uncalibrated camera. We show that for a pai...
Akihiro Sugimoto
IEEECIT
2010
IEEE
15 years 5 months ago
Study on the Industry Oriented Education for Computing of Ireland and Its Application
—This paper analyzes the mechanism of Industry Oriented Education of Ireland, especially in DIT and extracts useful experience to the education process of pilot software schools ...
Wu Tao, Chen Ya-ping, Ning Feng, Gu Xi-Qian
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak