Sciweavers

542 search results - page 31 / 109
» The Denjoy alternative for computable functions
Sort
View
ICALP
2009
Springer
16 years 6 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
ICCV
1999
IEEE
16 years 8 months ago
Multiway Cut for Stereo and Motion with Slanted Surfaces
Slanted surfaces pose a problem for correspondence algorithms utilizing search because of the greatly increased number of possibilities, when compared with frontoparallel surfaces...
Stan Birchfield, Carlo Tomasi
RECOMB
2002
Springer
16 years 6 months ago
Combining pairwise sequence similarity and support vector machines for remote protein homology detection
One key element in understanding the molecular machinery of the cell is to understand the meaning, or function, of each protein encoded in the genome. A very successful means of i...
Li Liao, William Stafford Noble
BMCBI
2007
144views more  BMCBI 2007»
15 years 6 months ago
Assessing the ability of sequence-based methods to provide functional insight within membrane integral proteins: a case study an
Background: Efforts to predict functional sites from globular proteins is increasingly common; however, the most successful of these methods generally require structural insight. ...
Dennis R. Livesay, Patrick D. Kidd, Sepehr Eskanda...
CSCLP
2008
Springer
15 years 8 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul