1055 search results - page 109 / 211 » Enumerations in computable structure theory |
136
click to vote
WABI
2005
Springer
15 years 10 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
147
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
162
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
137
click to vote
JNS
2008
15 years 4 months ago
2008
The bifurcation theory and numerics of periodic orbits of general dynamical systems is well developed, and in recent years there has been rapid progress in the development of a bi...
149
click to vote
PPOPP
2005
ACM
15 years 10 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...