Sciweavers

4106 search results - page 219 / 822
» A Computational Model for Metric Spaces
Sort
View
AIPS
1994
15 years 8 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
CORR
2000
Springer
81views Education» more  CORR 2000»
15 years 6 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
ICCV
2003
IEEE
16 years 8 months ago
Background Modeling and Subtraction of Dynamic Scenes
Background modeling and subtraction is a core component in motion analysis. The central idea behind such module is to create a probabilistic representation of the static scene tha...
Antoine Monnet, Anurag Mittal, Nikos Paragios, Vis...
BMVC
1998
15 years 8 months ago
Building Shape Models from Image Sequences using Piecewise Linear Approximation
A method of extracting, classifying and modelling non-rigid shapes from an image sequence is presented. Shapes are approximated by polygons where the number of sides is related to...
Derek R. Magee, Roger D. Boyle
PODC
2009
ACM
16 years 7 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...