Sciweavers

321 search results - page 35 / 65
» Comparison of Additive Trees Using Circular Orders
Sort
View
POPL
2009
ACM
15 years 6 months ago
Comparing the performance of concurrent linked-list implementations in Haskell
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
Martin Sulzmann, Edmund S. L. Lam, Simon Marlow
IWPC
2000
IEEE
15 years 4 months ago
A Framework for Experimental Evaluation of Clustering Techniques
Experimental evaluation of clustering techniques for component recovery is necessary in order to analyze their strengths and weaknesses in comparison to other techniques. For comp...
Rainer Koschke, Thomas Eisenbarth
DKE
2007
101views more  DKE 2007»
14 years 11 months ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
77
Voted
IAT
2010
IEEE
14 years 9 months ago
Possibility Degree Method for Ranking Intuitionistic Fuzzy Numbers
Abstract--In this paper, we study the method of ranking intuitionistic fuzzy numbers. Firstly a possibility degree formula is defined to compare two intuitionistic fuzzy numbers. W...
Cui-Ping Wei, Xijin Tang
TSMC
2002
142views more  TSMC 2002»
14 years 11 months ago
Adaptive color reduction
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...
Nikos Papamarkos, Antonios Atsalakis, Charalambos ...