Sciweavers

334 search results - page 48 / 67
» A model for comparing the space usage of lazy evaluators
Sort
View
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 2 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu
ER
2005
Springer
200views Database» more  ER 2005»
14 years 1 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
BIBE
2007
IEEE
138views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
A Flexible Stem-Based Local Search Algorithm for Predicting RNA Secondary Structures Including Pseudoknots
-We demonstrate a new algorithm named FlexStem to predict RNA secondary structures with pseudoknots. Our approach is based on the free energy minimization criterion, and utilizes a...
Xiang Chen, Simin He, Dongbo Bu, Runsheng Chen, We...
IJON
2010
139views more  IJON 2010»
13 years 6 months ago
Event monitoring via local motion abnormality detection in non-linear subspace
We present a computational approach to abnormal visual event detection, which is based on exploring and modeling local motion patterns in a non-linear subspace. We use motion vect...
Ioannis Tziakos, Andrea Cavallaro, Li-Qun Xu