Sciweavers

921 search results - page 66 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Allocation of indivisible goods: a general model and some complexity results
Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resou...
Sylvain Bouveret, Michel Lemaître, Hé...
BMCBI
2010
170views more  BMCBI 2010»
13 years 8 months ago
Integrative analysis of gene expression and copy number alterations using canonical correlation analysis
Background: With the rapid development of new genetic measurement methods, several types of genetic alterations can be quantified in a high-throughput manner. While the initial fo...
Charlotte Soneson, Henrik Lilljebjörn, Thoas ...
IPPS
2000
IEEE
14 years 8 days ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
AI
2010
Springer
13 years 8 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei