Sciweavers

1245 search results - page 76 / 249
» Playing with Conway's problem
Sort
View
BMCBI
2007
143views more  BMCBI 2007»
13 years 7 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
CVPR
2007
IEEE
14 years 9 months ago
Iterative MAP and ML Estimations for Image Segmentation
Image segmentation plays an important role in computer vision and image analysis. In this paper, the segmentation problem is formulated as a labeling problem under a probability m...
Shifeng Chen, Liangliang Cao, Jianzhuang Liu, Xiao...
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 7 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
PERCOM
2009
ACM
14 years 2 months ago
iMAP: Indirect Measurement of Air Pollution with Cellphones
Abstract—In this paper, we introduce the cellphonebased indirect sensing problem. While participatory sensing aims at monitoring of a phenomenon by deploying a dense set of senso...
Murat Demirbas, Carole Rudra, Atri Rudra, Murat Al...
FOCS
2007
IEEE
14 years 2 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx