10988 search results - page 394 / 2198 » Algorithmic Folding Complexity |
138
Voted
MOC
1998
15 years 4 months ago
1998
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
187
click to vote
OL
2011
14 years 12 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
115
click to vote
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
The power consumption of video enabled mobile devices is an ongoing challenge. The computational burden caused by the motion estimation process involved in video compression is th...
152
Voted
CONCUR
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
157
click to vote
IDA
2009
Springer
15 years 9 months ago
2009
Springer
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...