Sciweavers

2778 search results - page 34 / 556
» Limit complexities revisited
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
14 years 8 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
EUROCRYPT
2004
Springer
15 years 3 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
TWC
2008
117views more  TWC 2008»
14 years 9 months ago
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
Alireza Ghaderipoor, Chintha Tellambura
EDBT
2004
ACM
155views Database» more  EDBT 2004»
15 years 10 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
ASWEC
2005
IEEE
15 years 3 months ago
Software Reuse across Robotic Platforms: Limiting the Effects of Diversity
Robots have diverse capabilities and complex interactions with their environment. Software development for robotic platforms is time consuming due to the complex nature of the tas...
Glenn Smith, Robert Smith, Aster Wardhani