Sciweavers

380 search results - page 44 / 76
» Cluster Graphs as Abstractions for Constraint Satisfaction P...
Sort
View
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 9 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...
FMCO
2005
Springer
173views Formal Methods» more  FMCO 2005»
14 years 2 months ago
Cluster-Based LTL Model Checking of Large Systems
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
Jiri Barnat, Lubos Brim, Ivana Cerná
POPL
1992
ACM
14 years 22 days ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 3 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
ICML
2007
IEEE
14 years 9 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu