4591 search results - page 261 / 919 » Learning from Dyadic Data |
191
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
206
click to vote
MLG
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
129
click to vote
ALGORITHMICA
2005
15 years 4 months ago
2005
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
127
Voted
MLMI
2004
Springer
15 years 10 months ago
2004
Springer
As the amount of multimodal meetings data being recorded increases, so does the need for sophisticated mechanisms for accessing this data. This process is complicated by the diffe...
128
click to vote
SG
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Data hiding techniques onto images provide tools for protecting copyright or sending secret messages, and they are currently utilized as a simple input device of a cell p...