Sciweavers

338 search results - page 25 / 68
» Approximation Spaces and Information Granulation
Sort
View
69
Voted
IDEAL
2005
Springer
15 years 3 months ago
Bearing Similarity Measures for Self-organizing Feature Maps
The neural representation of space in rats has inspired many navigation systems for robots. In particular, Self-Organizing (Feature) Maps (SOM) are often used to give a sense of lo...
Narongdech Keeratipranon, Frédéric M...
PODS
2012
ACM
281views Database» more  PODS 2012»
12 years 12 months ago
Mergeable summaries
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang,...
CLEF
2011
Springer
13 years 9 months ago
Approaches for Intrinsic and External Plagiarism Detection - Notebook for PAN at CLEF 2011
Plagiarism detection has been considered as a classification problem which can be approximated with intrinsic strategies, considering self-based information from a given document,...
Gabriel Oberreuter, Gaston L'Huillier, Sebasti&aac...
ATAL
2003
Springer
15 years 2 months ago
Optimizing information exchange in cooperative multi-agent systems
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
Claudia V. Goldman, Shlomo Zilberstein
RECOMB
2006
Springer
15 years 9 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...