4451 search results - page 117 / 891 » On Random Ordering Constraints |
138
Voted
BMCBI
2008
15 years 4 months ago
2008
Background: Identification of approximate tandem repeats is an important task of broad significance and still remains a challenging problem of computational genomics. Often there ...
138
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we show that, surprisingly, it is possible to recover sparse signals from nonlinearly distorted measurements, even if the nonlinearity is unknown. Assuming just that...
144
click to vote
COMBINATORICS
2002
15 years 4 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
256
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
XML streams, such as RSS feeds or complex event streams, are becoming increasingly pervasive as they provide the foundation for a wide range of emerging applications. An important...
136
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...