Sciweavers

332 search results - page 52 / 67
» Parameterized Graph Separation Problems
Sort
View
CORR
2011
Springer
142views Education» more  CORR 2011»
12 years 11 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 8 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ICPR
2006
IEEE
14 years 8 months ago
A Semi-supervised SVM for Manifold Learning
Many classification tasks benefit from integrating manifold learning and semi-supervised learning. By formulating the learning task in a semi-supervised manner, we propose a novel...
Zhili Wu, Chun-hung Li, Ji Zhu, Jian Huang
SOCO
2009
Springer
14 years 1 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant