1431 search results - page 137 / 287 » The complexity of random ordered structures |
120
click to vote
CGA
1998
15 years 2 months ago
1998
This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions der...
133
Voted
DLOG
2007
15 years 5 months ago
2007
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
145
Voted
WIDM
2004
ACM
15 years 8 months ago
2004
ACM
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
109
click to vote
ESWS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...
139
click to vote
FUN
2010
Springer
15 years 6 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...