Sciweavers

1284 search results - page 91 / 257
» Data Structures for Mergeable Trees
Sort
View
GCB
2004
Springer
91views Biometrics» more  GCB 2004»
14 years 1 months ago
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
Hanjo Täubig, Arno Buchner, Jan Griebsch
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 8 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
SAMT
2007
Springer
123views Multimedia» more  SAMT 2007»
14 years 1 months ago
Region-based Annotation Tool using Partition Trees
Abstract—This paper presents an annotation tool for the manual and region-based annotation of still images. The selection of regions is achieved by navigating through a Partition...
Xavier Giro, Neus Camps, Ferran Marqués

Book
1815views
15 years 3 months ago
A Compact Guide to Lex & Yacc
"This document explains how to construct a compiler using lex and yacc. Lex and yacc are tools used to generate lexical analyzers and parsers. I assume you can program in C, a...
Tom Niemann