20294 search results - page 339 / 4059 » Algorithmic Information Theory |
203
Voted
DFG
2009
Springer
16 years 2 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
243
Voted
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 11 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
279
click to vote
SIGIR
2011
ACM
14 years 10 months ago
2011
ACM
Traditional recommendation algorithms often select products with the highest predicted ratings to recommend. However, earlier research in economics and marketing indicates that a ...
188
Voted
EUROPAR
2003
Springer
16 years 20 days ago
2003
Springer
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
194
Voted
SIGMOD
2010
ACM
16 years 8 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...