10412 search results - page 302 / 2083 » The efficiency of algorithms - misconceptions |
121
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patt...
137
click to vote
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
132
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
136
click to vote
IMR
2004
Springer
15 years 9 months ago
2004
Springer
Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the speed of propagation of th...
123
click to vote
ICALP
2009
Springer
15 years 8 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...