Sciweavers

2434 search results - page 389 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
IPSN
2007
Springer
15 years 10 months ago
Design and implementation of a wireless sensor network for intelligent light control
We present the design and implementation of the Illuminator, a preliminary sensor network-based intelligent light control system for entertainment and media production. Unlike mos...
Heemin Park, Jeff Burke, Mani B. Srivastava
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 5 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
MST
2006
149views more  MST 2006»
15 years 4 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
BMCBI
2005
78views more  BMCBI 2005»
15 years 4 months ago
Correlation test to assess low-level processing of high-density oligonucleotide microarray data
Background: There are currently a number of competing techniques for low-level processing of oligonucleotide array data. The choice of technique has a profound effect on subsequen...
Alexander Ploner, Lance D. Miller, Per Hall, Jonas...
PAISI
2009
Springer
15 years 10 months ago
Discovering Compatible Top-K Theme Patterns from Text Based on Users' Preferences
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
Yongxin Tong, Shilong Ma, Dan Yu, Yuanyuan Zhang, ...