Sciweavers

7785 search results - page 1311 / 1557
» The Concept of Dynamic Analysis
Sort
View
JOT
2007
170views more  JOT 2007»
15 years 6 months ago
Enough of Processes - Lets do Practices
All modern software development processes try to help project teams conduct their work. While there are some important differences between them, the commonalities are far greater ...
Ivar Jacobson, Pan Wei Ng, Ian Spence
ANOR
2004
170views more  ANOR 2004»
15 years 6 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
CN
2002
92views more  CN 2002»
15 years 6 months ago
TCP-friendly traffic conditioning in DiffServ networks: a memory-based approach
Recently, there has been a considerable research interest in designing intelligent markers, tailored for TCP traffic. Markers, one of the building blocks of a traffic conditioner ...
K. R. Renjish Kumar, Akkihebbal L. Ananda, Lillyku...
PAMI
2002
127views more  PAMI 2002»
15 years 6 months ago
Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation
The notion of fuzzy connectedness captures the idea of "hanging-togetherness" of image elements in an object by assigning a strength of connectedness to every possible pa...
Jayaram K. Udupa, Punam K. Saha, Roberto de Alenca...
RSA
2008
123views more  RSA 2008»
15 years 6 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
« Prev « First page 1311 / 1557 Last » Next »