10304 search results - page 1741 / 2061 » Computer science with the sciences: an emphasis in computati... |
186
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
169
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
186
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
168
Voted
DEXA
2009
Springer
16 years 1 months ago
2009
Springer
SHIRI 1 is an ontology-based system for integration of semistructured documents related to a specific domain. The system’s purpose is to allow users to access to relevant parts ...
181
Voted
ERSHOV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...