8828 search results - page 1205 / 1766 » Formal methods in practice |
186
click to vote
TVCG
2010
15 years 5 months ago
2010
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
227
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
230
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
223
click to vote
ACMDIS
2010
ACM
15 years 5 months ago
2010
ACM
Ideation Decks is a project that explores the development of a methodological tool for design ideation. It involves the creation and use of bespoke project-specific card based sys...
152
click to vote
BMVC
2010
15 years 5 months ago
2010
We propose a new boosting algorithm for sequence classification, in particular one that enables early classification of multiple classes. In many practical problems, we would like...