Sciweavers

777 search results - page 43 / 156
» The Refined Process Structure Tree
Sort
View
GEOINFO
2003
15 years 7 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
COOPIS
2002
IEEE
15 years 11 months ago
Intelligent Web Search via Personalizable Meta-search Agents
This paper addresses several problems associated with the specification of Web searches, and the retrieval, filtering, and rating of Web pages in order to improve the relevance, pr...
Larry Kerschberg, Wooju Kim, Anthony Scime
CSB
2005
IEEE
140views Bioinformatics» more  CSB 2005»
15 years 11 months ago
TPR Packing Analysis and 3D Modeling for the HAT Domain of Human Crooked Neck Protein
Human crooked neck protein (hcrn) containing 17 HAT or TPR repeats plays a role in pre-mRNA processing. Conserved residues in the TPR consensus sequence of 34 aa were found at hel...
Zhenglin Hou, Cunxi Wang, Odd-Arne Olsen
BTW
2005
Springer
108views Database» more  BTW 2005»
15 years 11 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
JOLLI
2010
94views more  JOLLI 2010»
15 years 4 months ago
Querying Linguistic Trees
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic ...
Catherine Lai, Steven Bird