4103 search results - page 598 / 821 » Some results on the Collatz problem |
166
click to vote
ACSC
2008
IEEE
16 years 29 days ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
166
click to vote
IJCNN
2008
IEEE
16 years 26 days ago
2008
IEEE
— Hybrid intelligent systems (HIS) are very successful in tackling problems comprising of more than one distinct computational subtask. For instance, decision-making problems are...
169
click to vote
SIGECOM
2005
ACM
16 years 1 days ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
190
click to vote
PKDD
2005
Springer
15 years 12 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
159
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...