Sciweavers

736 search results - page 77 / 148
» A dynamic data structure for approximate range searching
Sort
View
FLAIRS
2008
13 years 11 months ago
Answer Set Programming on Expert Feedback to Populate and Extend Dynamic Ontologies
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
Mathias Niepert, Cameron Buckner, Colin Allen
3DIM
2007
IEEE
14 years 3 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
AMW
2009
13 years 9 months ago
Consistent Query Answering in Data Warehouses
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
Leopoldo E. Bertossi, Loreto Bravo, Mónica ...
BMCBI
2006
85views more  BMCBI 2006»
13 years 8 months ago
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
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...
Rui Jiang, Hua Yang, Fengzhu Sun, Ting Chen
ISI
2008
Springer
13 years 8 months ago
Data mining for social network analysis
A social network is defined as a social structure of individuals, who are related (directly or indirectly to each other) based on a common relation of interest, e.g. friendship, t...
J. Srivastava