3134 search results - page 522 / 627 » Computing full disjunctions |
ICML
2006
IEEE
14 years 11 months ago
2006
IEEE
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
SIGSOFT
2005
ACM
14 years 10 months ago
2005
ACM
A fundamental part of a Computer Science degree is learning to program. Rather than starting students on a full commercial language, we favour using a dedicated "teaching lan...
SIGSOFT
2004
ACM
14 years 10 months ago
2004
ACM
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Generic database replication algorithms do not scale linearly in throughput as all update, deletion and insertion (UDI) queries must be applied to every database replica. The thro...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...