Sciweavers

2834 search results - page 234 / 567
» Representing Trees with Constraints
Sort
View
90
Voted
RECOMB
2004
Springer
16 years 1 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
98
Voted
DCC
2006
IEEE
15 years 6 months ago
Quantization on the Complex Projective Space
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...
Bishwarup Mondal, Satyaki Dutta, Robert W. Heath J...
126
Voted
CSCLP
2005
Springer
15 years 6 months ago
On Generators of Random Quasigroup Problems
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
Roman Barták
ICVS
2003
Springer
15 years 6 months ago
Automatic Video Interpretation: A Recognition Algorithm for Temporal Scenarios Based on Pre-compiled Scenario Models
This paper presents a new scenario recognition algorithm for Video Interpretation. We represent a scenario model with the characters involved in the scenario, with its sub-scenario...
Van-Thinh Vu, François Brémond, Moni...
HCW
1999
IEEE
15 years 5 months ago
Simulation of Task Graph Systems in Heterogeneous Computing Environments
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
Noé Lopez-Benitez, Ja-Young Hyon