Sciweavers

2434 search results - page 81 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
138
Voted
BMCBI
2008
133views more  BMCBI 2008»
15 years 3 months ago
CORE_TF: a user-friendly interface to identify evolutionary conserved transcription factor binding sites in sets of co-regulated
Background: The identification of transcription factor binding sites is difficult since they are only a small number of nucleotides in size, resulting in large numbers of false po...
Matthew S. Hestand, Michiel van Galen, Michel P. V...
CVPR
2005
IEEE
16 years 5 months ago
Restoration and Recognition in a Loop
In this paper we present a novel learning based method for restoring and recognizing images of digits that have been blurred using an unknown kernel. The novelty of our work is an...
Mithun Das Gupta, ShyamSundar Rajaram, Nemanja Pet...
COCO
2009
Springer
98views Algorithms» more  COCO 2009»
15 years 10 months ago
Extractors for Varieties
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
Zeev Dvir
IPL
2008
89views more  IPL 2008»
15 years 3 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
INFOCOM
2010
IEEE
15 years 1 months ago
Change Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
Praveen Kumar Muthuswamy, Koushik Kar, Sambit Sahu...