Sciweavers

1272 search results - page 231 / 255
» The Set Cover with Pairs Problem
Sort
View
BMCBI
2008
104views more  BMCBI 2008»
13 years 10 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
ICDE
2010
IEEE
220views Database» more  ICDE 2010»
13 years 8 months ago
Profiling linked open data with ProLOD
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
Christoph Böhm, Felix Naumann, Ziawasch Abedj...
PODS
2009
ACM
171views Database» more  PODS 2009»
14 years 10 months ago
XML schema mappings
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
Shun'ichi Amano, Leonid Libkin, Filip Murlak
FOCS
2006
IEEE
14 years 4 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
SPAA
2005
ACM
14 years 3 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