Sciweavers

239 search results - page 45 / 48
» Searching Protein 3-D Structures in Linear Time
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 12 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
ICIP
1999
IEEE
14 years 9 months ago
A Neural Network Approach to Interactive Content-Based Retrieval of Video Databases
A neural network scheme is presented in this paper for adaptive video indexing and retrieval. First, a limited but characteristic amount of frames are extracted from each video sc...
Nikolaos D. Doulamis, Anastasios D. Doulamis, Stef...
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
14 years 27 days ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
CCCG
2004
13 years 9 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
ACL
1998
13 years 9 months ago
PAT-Trees with the Deletion Function as the Learning Device for Linguistic Patterns
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...
Keh-Jiann Chen, Wen Tsuei, Lee-Feng Chien