3415 search results - page 60 / 683 » Lower Bounds for Kernelizations |
106
click to vote
CPM
2000
Springer
15 years 4 months ago
2000
Springer
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
134
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
101
Voted
STOC
2005
ACM
16 years 1 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
119
Voted
SPAA
2006
ACM
15 years 6 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
119
click to vote
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...