8294 search results - page 439 / 1659 » Presenting Data from Experiments in Algorithmics |
186
click to vote
ANSS
1991
IEEE
15 years 10 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
167
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
194
click to vote
EDBT
2004
ACM
16 years 7 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
195
Voted
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
304
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...