2434 search results - page 449 / 487 » Algorithmic Randomness of Closed Sets |
106
click to vote
ALMOB
2006
15 years 2 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
122
click to vote
LATIN
2010
Springer
15 years 11 days ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
136
click to vote
IPSN
2011
Springer
14 years 5 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
153
Voted
TMC
2012
13 years 4 months ago
2012
—3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communicatio...
125
click to vote
CPM
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...