8695 search results - page 1735 / 1739 » Making the Complex Simple |
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
COMPGEOM
2004
ACM
14 years 15 days ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
PODC
2004
ACM
14 years 15 days ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
FUN
2010
Springer
13 years 12 months ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...