6142 search results - page 494 / 1229 » The Complexity of Partition Functions |
189
click to vote
NIPS
2008
15 years 8 months ago
2008
In multi-task learning several related tasks are considered simultaneously, with the hope that by an appropriate sharing of information across tasks, each task may benefit from th...
180
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...
165
click to vote
NIPS
2007
15 years 8 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
213
click to vote
DBSEC
2006
15 years 8 months ago
2006
In the Database-As-a-Service (DAS) model, clients store their database contents at servers belonging to potentially untrusted service providers. To maintain data confidentiality, ...
159
click to vote
ERSA
2006
15 years 8 months ago
2006
Reconfigurable supercomputing (RSC) combines programmable logic chips with high performance microprocessors, all communicating over a high bandwidth, low latency interconnection n...