Sciweavers

2560 search results - page 54 / 512
» Contributions to zero-sum problems
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
KIC
2000
13 years 10 months ago
Design Simplification by Analogical Reasoning
Abstract: This paper presents some results of our research on design simplification by analogical reasoning. It first defines what we mean by a simplification problem. Then it desc...
M. E. Balazs, David C. Brown
IJCAI
1989
13 years 10 months ago
Constraint Satisfaction with Delayed Evaluation
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
Monte Zweben, Megan Eskey
IANDC
2008
74views more  IANDC 2008»
13 years 9 months ago
Execution monitoring enforcement under memory-limitation constraints
Recently, attention has been given to formally characterize security policies that are enforceable by different kinds of security mechanisms. A very important research problem is ...
Chamseddine Talhi, Nadia Tawbi, Mourad Debbabi
ICASSP
2011
IEEE
13 years 28 days ago
A unified approach to real time audio-to-score and audio-to-audio alignment using sequential Montecarlo inference techniques
We present a methodology for the real time alignment of music signals using sequential Montecarlo inference techniques. The alignment problem is formulated as the state tracking o...
Nicola Montecchio, Arshia Cont