Sciweavers

1055 search results - page 130 / 211
» Enumerations in computable structure theory
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 2 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
ALMOB
2007
170views more  ALMOB 2007»
13 years 10 months ago
A spatio-temporal mining approach towards summarizing and analyzing protein folding trajectories
Understanding the protein folding mechanism remains a grand challenge in structural biology. In the past several years, computational theories in molecular dynamics have been empl...
Hui Yang, Srinivasan Parthasarathy, Duygu Ucar
ATAL
2011
Springer
12 years 10 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
ICIP
2003
IEEE
14 years 11 months ago
Dither-modulation data hiding with distortion-compensation: exact performance analysis and an improved detector for JPEG attacks
The binary Distortion Compensated Dither-Modulation (DCDM), which can be regarded to as a baseline for quantizationbased data-hiding methods, is rigorously analyzed. A novel and a...
Félix Balado, Fernando Pérez-Gonz&aa...
DAC
2003
ACM
14 years 11 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam