17688 search results - page 198 / 3538 » Data Set Balancing |
156
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
168
click to vote
ENGL
2007
15 years 6 months ago
2007
—This paper describes a methodology based on Answer Set Programming (ASP) to work with incomplete geographic data. Source geographic data which describes a risk zone is translate...
168
click to vote
HPDC
2007
IEEE
15 years 10 months ago
2007
IEEE
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
160
click to vote
BMCBI
2006
2006
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
15 years 6 months ago
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
141
click to vote
PVLDB
2008
15 years 6 months ago
2008
Beyond already existing huge data volumes, e-science communities face major challenges in managing the anticipated data deluge of forthcoming projects. Community-driven data grids...