Sciweavers

249 search results - page 15 / 50
» Finding Patterns in Given Intervals
Sort
View
ICALP
2009
Springer
14 years 8 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
Michael Ummels, Dominik Wojtczak
DATAMINE
2008
219views more  DATAMINE 2008»
13 years 8 months ago
Correlating burst events on streaming stock market data
Abstract We address the problem of monitoring and identification of correlated burst patterns in multi-stream time series databases. We follow a two-step methodology: first we iden...
Michail Vlachos, Kun-Lung Wu, Shyh-Kwei Chen, Phil...
IJUFKS
2002
78views more  IJUFKS 2002»
13 years 8 months ago
On the Security of Microaggregation with Individual Ranking: Analytical Attacks
Microaggregation is a statistical disclosure control technique. Raw microdata (i.e. individual records) are grouped into small aggregates prior to publication. With fixed-size grou...
Josep Domingo-Ferrer, Josep Maria Mateo-Sanz, Anna...
DELTA
2008
IEEE
13 years 10 months ago
Test Set Stripping Limiting the Maximum Number of Specified Bits
This paper presents a technique that limits the maximum number of specified bits of any pattern in a given test set. The outlined method uses algorithms similar to ATPG, but explo...
Michael A. Kochte, Christian G. Zoellin, Michael E...
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
14 years 3 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...