Sciweavers

428 search results - page 71 / 86
» Completeness of a Fact Extractor
Sort
View
STACS
2007
Springer
15 years 3 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
CGO
2006
IEEE
15 years 3 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...
IISWC
2006
IEEE
15 years 3 months ago
Comparing Benchmarks Using Key Microarchitecture-Independent Characteristics
— Understanding the behavior of emerging workloads is important for designing next generation microprocessors. For addressing this issue, computer architects and performance anal...
Kenneth Hoste, Lieven Eeckhout
FOCS
2005
IEEE
15 years 3 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
WISE
2005
Springer
15 years 3 months ago
A Formal Ontology Reasoning with Individual Optimization: A Realization of the Semantic Web
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...
Pakornpong Pothipruk, Guido Governatori