Sciweavers

2061 search results - page 406 / 413
» The continuous knapsack set
Sort
View
QEST
2010
IEEE
14 years 10 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak
ASWC
2009
Springer
14 years 10 months ago
SHARE: A Semantic Web Query Engine for Bioinformatics
Driven by the goal of automating data analyses in the field of bioinformatics, SHARE (Semantic Health and Research Environment) is a specialized SPARQL engine that resolves queries...
Benjamin P. Vandervalk, E. Luke McCarthy, Mark D. ...
CLUSTER
2009
IEEE
14 years 10 months ago
Coordinating the use of GPU and CPU for improving performance of compute intensive applications
GPUs have recently evolved into very fast parallel co-processors capable of executing general purpose computations extremely efficiently. At the same time, multi-core CPUs evolutio...
George Teodoro, Rafael Sachetto Oliveira, Olcay Se...
ECCC
2010
83views more  ECCC 2010»
14 years 10 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
155
Voted
AML
2011
204views Mathematics» more  AML 2011»
14 years 7 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek