424 search results - page 80 / 85 » Balanced Incomplete Factorization |
142
Voted
CASES
2005
ACM
15 years 3 months ago
2005
ACM
Instruction set customization accelerates the performance of applications by compressing the length of critical dependence paths and reducing the demands on processor resources. W...
117
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
140
click to vote
NIPS
2000
15 years 3 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
114
click to vote
BIS
2009
15 years 2 months ago
2009
Abstract. In current dynamic business environment, it has been argued that certain characteristics of ad-hocism in business processes are desirable. Such business processes typical...
106
click to vote
CEC
2010
IEEE
15 years 2 months ago
2010
IEEE
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...