115 search results - page 10 / 23 » The Complexity of List Ranking of Trees |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
PODS
2010
ACM
15 years 3 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
AAAI
2006
14 years 11 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
110
click to vote
TIC
2000
Springer
15 years 1 months ago
2000
Springer
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
TSP
2010
14 years 4 months ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...