Sciweavers

2176 search results - page 419 / 436
» Refactoring Methods for Knowledge Bases
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
79
Voted
IPPS
2005
IEEE
15 years 3 months ago
Self-Adaptive Scheduler Parameterization via Online Simulation
High-end parallel systems present a tremendous research challenge on how to best allocate their resources to match dynamic workload characteristics and user habits that are often ...
Barry Lawson, Evgenia Smirni
SIGIR
2005
ACM
15 years 3 months ago
Surrogate scoring for improved metasearch precision
We describe a method for improving the precision of metasearch results based upon scoring the visual features of documents' surrogate representations. These surrogate scores ...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...
SIGSOFT
2005
ACM
15 years 3 months ago
PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code
Programs usually follow many implicit programming rules, most of which are too tedious to be documented by programmers. When these rules are violated by programmers who are unawar...
Zhenmin Li, Yuanyuan Zhou
AUSAI
2005
Springer
15 years 3 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb