Sciweavers

176 search results - page 5 / 36
» Sorting and Selection with Random Costs
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
13 years 11 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
ICDCS
2009
IEEE
13 years 5 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
ICML
1994
IEEE
13 years 11 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
EMNLP
2004
13 years 9 months ago
Active Learning and the Total Cost of Annotation
Active learning (AL) promises to reduce the cost of annotating labeled datasets for trainable human language technologies. Contrary to expectations, when creating labeled training...
Jason Baldridge, Miles Osborne
ESEM
2008
ACM
13 years 9 months ago
Pair programming: what's in it for me?
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
Andrew Begel, Nachiappan Nagappan