Sciweavers

920 search results - page 16 / 184
» Computing the Frequency of Partial Orders
Sort
View
ORDER
2010
110views more  ORDER 2010»
13 years 6 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
CIE
2008
Springer
13 years 7 months ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
ISMIR
2005
Springer
157views Music» more  ISMIR 2005»
14 years 1 months ago
A Partial Searching Algorithm and Its Application for Polyphonic Music Transcription
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...
Wen Xue, M. Sandler
DPD
2008
136views more  DPD 2008»
13 years 7 months ago
A cache invalidation scheme for continuous partial match queries in mobile computing environments
The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile client...
Yon Dohn Chung
RECOMB
2006
Springer
14 years 8 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...