Sciweavers

297 search results - page 58 / 60
» Every Sequence Is Decompressible from a Random One
Sort
View
SPAA
2005
ACM
15 years 4 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
95
Voted
ICIP
1999
IEEE
15 years 3 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
BMCBI
2008
142views more  BMCBI 2008»
14 years 11 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
LICS
2000
IEEE
15 years 3 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
BMCBI
2010
176views more  BMCBI 2010»
14 years 11 months ago
Bayesian statistical modelling of human protein interaction network incorporating protein disorder information
Background: We present a statistical method of analysis of biological networks based on the exponential random graph model, namely p2-model, as opposed to previous descriptive app...
Svetlana Bulashevska, Alla Bulashevska, Roland Eil...