Sciweavers

8728 search results - page 1352 / 1746
» On Reduct Construction Algorithms
Sort
View
FCT
2005
Springer
16 years 11 days ago
Almost Optimal Explicit Selectors
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Bogdan S. Chlebus, Dariusz R. Kowalski
FSE
2005
Springer
116views Cryptology» more  FSE 2005»
16 years 11 days ago
Narrow T-Functions
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
Magnus Daum
168
Voted
GD
2005
Springer
16 years 11 days ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
GECCO
2005
Springer
134views Optimization» more  GECCO 2005»
16 years 11 days ago
Tracking extrema in dynamic environments using a coevolutionary agent-based model of genotype edition
Typical applications of evolutionary optimization in static environments involve the approximation of the extrema of functions. For dynamic environments, the interest is not to lo...
Chien-Feng Huang, Luis Mateus Rocha
KNINVI
2005
Springer
16 years 10 days ago
Concept Maps: Integrating Knowledge and Information Visualization
Information visualization has been a research topic for many years, leading to a mature field where guidelines and practices are well established. Knowledge visualization, in contr...
Alberto J. Cañas, Roger Carff, Greg Hill, M...
« Prev « First page 1352 / 1746 Last » Next »