Sciweavers

194 search results - page 21 / 39
» The Parameterized Complexity of Some Minimum Label Problems
Sort
View
ICLP
2010
Springer
15 years 4 months ago
Using Generalized Annotated Programs to Solve Social Network Optimization Problems
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
Paulo Shakarian, V. S. Subrahmanian, Maria Luisa S...
ICCD
2007
IEEE
179views Hardware» more  ICCD 2007»
15 years 9 months ago
Energy-aware co-processor selection for embedded processors on FPGAs
In this paper, we present co-processor selection problem for minimum energy consumption in hw/sw co-design on FPGAs with dual power mode. We provide theoretical analysis for the p...
Amir Hossein Gholamipour, Elaheh Bozorgzadeh, Suda...
CSL
2000
Springer
15 years 4 months ago
Composition and Submachine Concepts for Sequential ASMs
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
Egon Börger, Joachim Schmid
121
Voted
BMCBI
2007
109views more  BMCBI 2007»
15 years 18 days ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
103
Voted
CVPR
2003
IEEE
16 years 2 months ago
Learning Object Intrinsic Structure for Robust Visual Tracking
In this paper, a novel method to learn the intrinsic object structure for robust visual tracking is proposed. The basic assumption is that the parameterized object state lies on a...
Qiang Wang, Guangyou Xu, Haizhou Ai