Sciweavers

387 search results - page 8 / 78
» Towards in-place geometric algorithms and data structures
Sort
View
WABI
2005
Springer
15 years 11 months ago
Rotamer-Pair Energy Calculations Using a Trie Data Structure
Abstract. Protein design software places amino acid side chains by precomputing rotamer-pair energies and optimizing rotamer placement. If the software optimizes by rapid stochasti...
Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
CIKM
2005
Springer
15 years 11 months ago
Towards automatic association of relevant unstructured content with structured query results
Faced with growing knowledge management needs, enterprises are increasingly realizing the importance of seamlessly integrating critical business information distributed across bot...
Prasan Roy, Mukesh K. Mohania, Bhuvan Bamba, Shree...
IS
2007
15 years 5 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
NGC
2006
Springer
135views Communications» more  NGC 2006»
15 years 5 months ago
Seeing Things: Inventive Reasoning with Geometric Analogies and Topographic Maps
This paper examines two seemingly unrelated qualitative spatial reasoning domains; geometric proportional analogies and topographic (landcover) maps. We present a Structure Matchin...
Diarmuid P. O'Donoghue, Amy J. Bohan, Mark T. Kean...
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park