4903 search results - page 264 / 981 » The Set Covering Machine |
187
click to vote
WADS
1997
Springer
15 years 11 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
164
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
156
click to vote
BCSHCI
2008
15 years 8 months ago
2008
In this paper, we look at the application of the DiCoT methodology [4] to the analysis of a mobile healthcare setting. While the methodology includes a set of principles and theme...
172
click to vote
NIPS
1998
15 years 8 months ago
1998
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
206
click to vote
EC
2008
15 years 6 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...