Sciweavers

1529 search results - page 235 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
14 years 1 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
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
ECCV
2008
Springer
14 years 10 months ago
Higher Dimensional Affine Registration and Vision Applications
Abstract. Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in IR2 and IR3 . In this pa...
Yu-Tseh Chi, S. M. Nejhum Shahed, Jeffrey Ho, Ming...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 29 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...