102291 search results - page 19884 / 20459 » Computing |
137
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
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 ...
139
click to vote
COMPSAC
2007
IEEE
15 years 8 months ago
2007
IEEE
The world is increasingly dependent on critical infrastructures such as the electric power grid, water, gas, and oil transport systems, which are susceptible to cascading failures...
130
click to vote
CICLING
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Automated language identification of written text is a wellestablished research domain that has received considerable attention in the past. By now, efficient and effecti...
137
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
158
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...