Sciweavers

260 search results - page 22 / 52
» Resolution Complexity of Independent Sets in Random Graphs
Sort
View
ATAL
2007
Springer
14 years 1 months ago
Conditional random fields for activity recognition
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
Douglas L. Vail, Manuela M. Veloso, John D. Laffer...
AVI
2004
13 years 8 months ago
A graph-based interface to complex hypermedia structure visualization
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
Manuel Freire, Pilar Rodríguez
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 11 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
14 years 7 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 4 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald