1277 search results - page 56 / 256 » Terminating Decision Algorithms Optimally |
136
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
153
click to vote
AAAI
2000
15 years 4 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
132
click to vote
MTA
2007
15 years 2 months ago
2007
This paper describes novel transcoding techniques aimed for low-complexity MPEG-2 to H.264/AVC transcoding. An important application for this type of conversion is efficient stor...
121
click to vote
PODC
2004
ACM
15 years 8 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
105
click to vote
INFORMATICASI
1998
15 years 2 months ago
1998
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...