Sciweavers

6315 search results - page 959 / 1263
» Approximating Solution Structure
Sort
View
133
Voted
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 5 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
ENTCS
2010
133views more  ENTCS 2010»
15 years 4 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
DKE
2006
125views more  DKE 2006»
15 years 4 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
IJBC
2008
63views more  IJBC 2008»
15 years 4 months ago
On Isoconcentration Surfaces of Three-Dimensional Turing Patterns
We consider three dimensional Turing patterns and their isoconcentration surfaces corresponding to the equilibrium concentration of the reaction kinetics. We call these surfaces eq...
Tilmann Glimm, H. George E. Hentschel
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 4 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri