2930 search results - page 319 / 586 » The optimal sequence compression |
204
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
159
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
178
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
168
click to vote
EMMCVPR
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
168
click to vote
ISAAC
2005
Springer
16 years 4 days ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...