Sciweavers

817 search results - page 63 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
PVLDB
2008
126views more  PVLDB 2008»
13 years 8 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
IPPS
2002
IEEE
14 years 1 months ago
A High Performance Algorithm for Incompressible Flows Using Local Solenoidal Functions
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
Sreekanth R. Sambavaram, Vivek Sarin
CVPR
2010
IEEE
14 years 5 months ago
Clustering Dynamic Textures with the Hierarchical EM Algorithm
The dynamic texture (DT) is a probabilistic generative model, defined over space and time, that represents a video as the output of a linear dynamical system (LDS). The DT model ...
Antoni Chan, Emanuele Coviello, Gert Lanckriet
IJON
2002
85views more  IJON 2002»
13 years 8 months ago
Learning statistically efficient features for speaker recognition
We apply independent component analysis (ICA) for extracting an optimal basis to the problem of finding efficient features for a speaker. The basis functions learned by the algori...
Gil-Jin Jang, Te-Won Lee, Yung-Hwan Oh
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 24 days ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...