5153 search results - page 477 / 1031 » Introduction to Randomized Algorithms |
196
click to vote
FPGA
2000
ACM
15 years 10 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
190
click to vote
AAAI
2008
15 years 8 months ago
2008
In multi-robot settings, activity recognition allows a robot to respond intelligently to the other robots in its environment. Conditional random fields are temporal models that ar...
180
click to vote
AAAI
2006
15 years 7 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
169
click to vote
AVI
2006
15 years 7 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
142
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...