1089 search results - page 56 / 218 » Bounds on generalized Frobenius numbers |
ESA
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
100
click to vote
ICDCS
2010
IEEE
15 years 3 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
CCS
2008
ACM
15 years 1 months ago
2008
ACM
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
107
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
112
click to vote
BMCBI
2007
14 years 12 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...