Sciweavers

3894 search results - page 725 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
TSP
2010
14 years 6 months ago
Gaussian multiresolution models: exploiting sparse Markov and covariance structure
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
14 years 2 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
EMNLP
2011
13 years 11 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
Ni Lao, Tom M. Mitchell, William W. Cohen
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
16 years 1 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou
DAC
2005
ACM
16 years 25 days ago
Diffusion-based placement migration
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...
Haoxing Ren, David Zhigang Pan, Charles J. Alpert,...