Sciweavers

380 search results - page 20 / 76
» A Categorical Setting for Lower Complexity
Sort
View
JGAA
2006
127views more  JGAA 2006»
14 years 9 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
15 years 10 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
78
Voted
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
14 years 11 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
IJCNN
2007
IEEE
15 years 3 months ago
Integrating a Flexible Representation Machinery in a Model of Human Concept Learning
— High-order human cognition involves processing of abstract and categorically represented knowledge. Traditionally, it has been considered that there is a single innate internal...
Toshihiko Matsuka, Yasuaki Sakamoto
TRS
2008
14 years 9 months ago
The Neurophysiological Bases of Cognitive Computation Using Rough Set Theory
A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capabi...
Andrzej W. Przybyszewski