Sciweavers

1456 search results - page 111 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
AAAI
1996
15 years 14 days ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
IPPS
1996
IEEE
15 years 3 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
INFOCOM
2006
IEEE
15 years 5 months ago
ISP and Egress Path Selection for Multihomed Networks
— Multihoming has been used by stub networks for several years as a form of redundancy, improving the availability of Internet access. More recently, Intelligent Route Control (I...
Amogh Dhamdhere, Constantinos Dovrolis
JACM
2010
135views more  JACM 2010»
14 years 9 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
PRL
2010
159views more  PRL 2010»
14 years 9 months ago
Creating diverse nearest-neighbour ensembles using simultaneous metaheuristic feature selection
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
Muhammad Atif Tahir, Jim E. Smith