Sciweavers

1940 search results - page 169 / 388
» Optimizing search engines using clickthrough data
Sort
View
CGO
2007
IEEE
16 years 18 days ago
Exploiting Narrow Accelerators with Data-Centric Subgraph Mapping
The demand for high performance has driven acyclic computation accelerators into extensive use in modern embedded and desktop architectures. Accelerators that are ideal from a sof...
Amir Hormati, Nathan Clark, Scott A. Mahlke
ISPW
2009
IEEE
16 years 27 days ago
On the Relative Merits of Software Reuse
Abstract. Using process simulation and AI search methods, we compare software reuse against other possible changes to a project. such as reducing functionality or improving the ski...
Andres S. Orrego, Tim Menzies, Oussama El-Rawas
SCAM
2007
IEEE
16 years 16 days ago
Finding Inputs that Reach a Target Expression
We present an automated program analysis, called Reach, to compute program inputs that cause evaluation of explicitly-marked target expressions. Reach has a range of applications ...
Matthew Naylor, Colin Runciman
165
Voted
CEC
2008
IEEE
16 years 22 days ago
A Quantum-inspired Genetic Algorithm for data clustering
—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
Jing Xiao, YuPing Yan, Ying Lin, Ling Yuan, Jun Zh...
247
Voted
ICDE
2011
IEEE
207views Database» more  ICDE 2011»
14 years 10 months ago
Monte Carlo query processing of uncertain multidimensional array data
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
Tingjian Ge, David Grabiner, Stanley B. Zdonik