Sciweavers

1525 search results - page 184 / 305
» Matching with Regular Constraints
Sort
View
AMAST
1998
Springer
15 years 10 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
CVRMED
1997
Springer
15 years 10 months ago
Volumetric medical images segmentation using shape constrained deformable models
In this paper we address the problem of extracting geometric models from low contrast volumetric images, given a template or reference shape of that model. We proceed by deforming...
Johan Montagnat, Hervé Delingette
ICASSP
2009
IEEE
15 years 9 months ago
Joint estimation of short-term and long-term predictors in speech coders
In low bit-rate coders, the near-sample and far-sample redundancies of the speech signal are usually removed by a cascade of a shortterm and a long-term linear predictor. These tw...
Daniele Giacobello, Mads Græsbøll Chr...
AAIM
2008
Springer
142views Algorithms» more  AAIM 2008»
15 years 7 months ago
Engineering Label-Constrained Shortest-Path Algorithms
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
NETWORKING
2007
15 years 7 months ago
The Token Based Switch: Per-Packet Access Authorisation to Optical Shortcuts
Abstract. Our Token Based Switch (TBS) implementation shows that a packetbased admission control system can be used to dynamically select a fast end-to-end connection over a hybrid...
Mihai-Lucian Cristea, Leon Gommans, Li Xu, Herbert...