921 search results - page 101 / 185 » New Data Structures for Orthogonal Range Searching |
131
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Discovering complex associations, anomalies and patterns in distributed data sets is gaining popularity in a range of scientific, medical and business applications. Various algor...
155
click to vote
VTC
2010
IEEE
15 years 2 months ago
2010
IEEE
—This paper proposes a new wireless scheduling methodology which takes advantage of future predictions of data rate for the several users competing for physical access. Based on ...
155
click to vote
VMV
2000
15 years 5 months ago
2000
Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., B-splines are smooth curves or surfaces that can be construc...
119
click to vote
AE
2007
Springer
15 years 10 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
120
Voted
BMCBI
2008
15 years 4 months ago
2008
Background: FREGENE simulates sequence-level data over large genomic regions in large populations. Because, unlike coalescent simulators, it works forwards through time, it allows...