Sciweavers

635 search results - page 44 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
Learning Cross-modality Similarity for Multinomial Data
Many applications involve multiple-modalities such as text and images that describe the problem of interest. In order to leverage the information present in all the modalities, on...
Yangqing Jia, Mathieu Salzmann, Trevor Darrell
102
Voted
DM
2006
128views more  DM 2006»
14 years 9 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
14 years 8 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 10 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
GG
2004
Springer
15 years 3 months ago
Embedding in Switching Classes with Skew Gains
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Gr...