Sciweavers

2009 search results - page 309 / 402
» Dense Interest Points
Sort
View
FAC
2008
100views more  FAC 2008»
13 years 8 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
FSS
2008
94views more  FSS 2008»
13 years 8 months ago
Lattices of convex normal functions
The algebra of truth values of type-2 fuzzy sets is the set of all functions from the unit interval into itself, with operations de ned in terms of certain convolutions of these f...
John Harding, Carol L. Walker, Elbert A. Walker
IAJIT
2008
78views more  IAJIT 2008»
13 years 8 months ago
Performance Analyses of Fast Frequency Hopping Spread Spectrum and Jamming Systems
: As technology becomes increasingly able to meet the requirements, interest in faster, noncoherent, frequency hopping rates to reduce the jamming of communication has heightened. ...
Abid Yahya, Othman Sidek, Junita Mohamad-Saleh
CLEIEJ
2006
192views more  CLEIEJ 2006»
13 years 8 months ago
Applying Software Metrics to evaluate Business Process Models
In this paper, we define a set of metrics for the evaluation of conceptual models of business processes. The proposal supposes the adaptation and extension of the FMESP framework ...
Elvira Rolón Aguilar, Francisco Ruiz, F&eac...
COMGEO
2006
ACM
13 years 8 months ago
Inner and outer rounding of Boolean operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
Olivier Devillers, Philippe Guigue