1814 search results - page 104 / 363 » Watermarking relational data: framework, algorithms and anal... |
101
click to vote
OTM
2005
Springer
15 years 4 months ago
2005
Springer
The strong dynamics of peer-to-peer networks, coupled with the diversity of peer vocabularies, makes query processing in peer database systems a very challenging task. In this pape...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
ICIP
2008
IEEE
15 years 5 months ago
2008
IEEE
—Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms usi...
103
click to vote
COLT
2007
Springer
15 years 5 months ago
2007
Springer
In the multi-view regression problem, we have a regression problem where the input variable (which is a real vector) can be partitioned into two different views, where it is assum...
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...