8917 search results - page 474 / 1784 » Abstraction in Algorithm Animation |
155
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
167
click to vote
AAECC
2006
Springer
16 years 26 days ago
2006
Springer
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...
136
click to vote
SIGMETRICS
2006
ACM
16 years 24 days ago
2006
ACM
Abstract— We consider a wireless system with multiple channels where each channel is either on or off, and probing the state of any channel incurs a cost. We present a polynomial...
146
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
157
Voted
ICCBR
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. In this paper, we propose an approach to attach semantic annotations to textual cases for their representation. To achieve this goal, a framework that combines machine le...