Sciweavers

5244 search results - page 158 / 1049
» Structural Complexity of AvgBPP
Sort
View
131
Voted
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 4 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
BSL
2000
153views more  BSL 2000»
15 years 4 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 4 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
VTC
2008
IEEE
15 years 11 months ago
Reduced-Complexity Adaptive Receiver Algorithms for 4G SU-MIMO Systems
Abstract—In this paper we present reduced-complexity highperformance receivers for single-user MIMO systems that employ coded OFDM transmission with bit-interleaved coded modulat...
Ozgun Y. Bursalioglu, Haralabos C. Papadopoulos, C...
ECAI
2010
Springer
15 years 5 months ago
Open-ended Grounded Semantics
Artificial agents trying to achieve communicative goals in situated interactions in the real-world need powerful computational systems for conceptualizing their environment. In ord...
Michael Spranger, Martin Loetzsch, Simon Pauw