893 search results - page 44 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
128
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Motivated by the problem of customer wallet estimation, we propose a new setting for multi-view regression, where we learn a completely unobserved target (in our case, customer wa...
122
click to vote
TIME
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
150
click to vote
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
— This paper proposes a new algorithm to identify and compose building blocks based on minimum mutual information criterion. Building blocks are interpreted as common subsequence...
104
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
142
click to vote
ICC
2011
IEEE
14 years 2 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...