8825 search results - page 271 / 1765 » All for one or one for all |
VLDB
2000
ACM
15 years 5 months ago
2000
ACM
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean...
119
click to vote
ICDT
1995
ACM
15 years 5 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
106
click to vote
ACNS
2008
Springer
15 years 3 months ago
2008
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
121
click to vote
COLT
2006
Springer
15 years 3 months ago
2006
Springer
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
CONEXT
2008
ACM
15 years 3 months ago
2008
ACM
Planetlab is widely recognized as being one of the most important Internet-scale testbeds. However, while allowing experimentations involving hundreds of hosts spread all over the...