Sciweavers

922 search results - page 130 / 185
» Engineering a complex ontology with time
Sort
View
SIAMCOMP
2011
14 years 5 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
FSTTCS
1992
Springer
15 years 2 months ago
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
Vikraman Arvind, Johannes Köbler, Martin Mund...
AMAST
2004
Springer
15 years 3 months ago
A Science of Software Design
concerns, abstraction (particularly hierarchical abstraction), simplicity, and restricted visibility (locality of information). The overall goal behind these principles was stated ...
Don S. Batory
QOSA
2010
Springer
15 years 2 months ago
Validating Model-Driven Performance Predictions on Random Software Systems
Abstract. Software performance prediction methods are typically validated by taking an appropriate software system, performing both performance predictions and performance measurem...
Vlastimil Babka, Petr Tuma, Lubomír Bulej
WWW
2011
ACM
14 years 5 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh