Sciweavers

9659 search results - page 1767 / 1932
» Points on Computable Curves
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 4 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
177
Voted
BMVC
2010
15 years 4 months ago
Background Modelling on Tensor Field for Foreground Segmentation
The paper proposes a new method to perform foreground detection by means of background modeling using the tensor concept. Sometimes, statistical modelling directly on image values...
Rui Caseiro, Jorge Batista, Pedro Martins
IWPEC
2010
Springer
15 years 4 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
EUSFLAT
2009
146views Fuzzy Logic» more  EUSFLAT 2009»
15 years 3 months ago
Opposite Fuzzy Sets with Applications in Image Processing
Diverse forms of the concept of opposition are already existent in philosophy, linguistics, psychology and physics. The interplay between entities and opposite entities is apparent...
Hamid R. Tizhoosh
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
15 years 3 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
« Prev « First page 1767 / 1932 Last » Next »