Sciweavers

3690 search results - page 737 / 738
» Computation with classical sequents
Sort
View
TKDE
2012
192views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Discriminative Feature Selection by Nonparametric Bayes Error Minimization
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
Shuang-Hong Yang, Bao-Gang Hu
ICFP
2012
ACM
11 years 9 months ago
Nested data-parallelism on the gpu
Graphics processing units (GPUs) provide both memory bandwidth and arithmetic performance far greater than that available on CPUs but, because of their Single-Instruction-Multiple...
Lars Bergstrom, John H. Reppy
ICSE
2012
IEEE-ACM
11 years 9 months ago
WitchDoctor: IDE support for real-time auto-completion of refactorings
—Integrated Development Environments (IDEs) have come to perform a wide variety of tasks on behalf of the programmer, refactoring being a classic example. These operations have u...
Stephen R. Foster, William G. Griswold, Sorin Lern...
ICALP
2009
Springer
14 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
STACS
2007
Springer
14 years 29 days ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman