Sciweavers

363 search results - page 51 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
ICSE
2008
IEEE-ACM
14 years 7 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
14 years 1 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
ECML
2006
Springer
13 years 11 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...
ARC
2008
Springer
115views Hardware» more  ARC 2008»
13 years 9 months ago
A High Throughput FPGA-based Floating Point Conjugate Gradient Implementation
As Field Programmable Gate Arrays (FPGAs) have reached capacities beyond millions of equivalent gates, it becomes possible to accelerate floating-point scientific computing applica...
Antonio Roldao Lopes, George A. Constantinides
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
13 years 9 months ago
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
Wei Chen, Chi Wang, Yajun Wang