Sciweavers

6142 search results - page 162 / 1229
» The Complexity of Partition Functions
Sort
View
146
Voted
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 3 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
ICA
2004
Springer
15 years 8 months ago
Unraveling Spatio-temporal Dynamics in fMRI Recordings Using Complex ICA
Abstract. Independent component analysis (ICA) of functional magnetic resonance imaging (fMRI) data is commonly carried out under the assumption that each source may be represented...
Jörn Anemüller, Jeng-Ren Duann, Terrence...
107
Voted
APL
1998
ACM
15 years 7 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
ICDE
2006
IEEE
133views Database» more  ICDE 2006»
16 years 4 months ago
ViEWNet: Visual Exploration of Region-Wide Traffic Networks
Location-based services and data mining algorithms analyzing objects moving on a complex traffic network are becoming increasingly important. In this paper, we introduce a new app...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
119
Voted
ICIP
2007
IEEE
15 years 7 months ago
H.263 to H.264 Transconding using Data Mining
1 In this paper, we propose the use of data mining algorithms to create a macroblock partition mode decision algorithm for inter-frame prediction, to be used as part of a high-effi...
Gerardo Fernández-Escribano, Jens Bialkowsk...