921 search results - page 31 / 185 » New Data Structures for Orthogonal Range Searching |
132
Voted
DNIS
2005
Springer
15 years 9 months ago
2005
Springer
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
123
Voted
BMCBI
2006
2006
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
15 years 3 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...
125
Voted
COMPGEOM
2001
ACM
15 years 7 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...
143
click to vote
ICSE
2010
IEEE-ACM
15 years 8 months ago
2010
IEEE-ACM
Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices such as program assert...
210
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...