Sciweavers

11160 search results - page 1849 / 2232
» Incompleteness in a General Setting
Sort
View
COMPGEOM
2007
ACM
15 years 10 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
COMPGEOM
2007
ACM
15 years 10 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
15 years 10 months ago
Ensemble pruning via individual contribution ordering
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
Zhenyu Lu, Xindong Wu, Xingquan Zhu, Josh Bongard
ESEM
2007
ACM
15 years 10 months ago
A Critical Analysis of Empirical Research in Software Testing
In the foreseeable future, software testing will remain one of the best tools we have at our disposal to ensure software dependability. Empirical studies are crucial to software t...
Lionel C. Briand
SIGIR
2010
ACM
15 years 10 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
« Prev « First page 1849 / 2232 Last » Next »