Sciweavers

2996 search results - page 166 / 600
» Numberings and Randomness
Sort
View
RANDOM
1999
Springer
15 years 9 months ago
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
Tugkan Batu, Ronitt Rubinfeld, Patrick White
134
Voted
DEXA
1994
Springer
102views Database» more  DEXA 1994»
15 years 9 months ago
The Design and Implementation of a Legal Text Database
We describe the design and implementation of a legal text database. The database of provides a number of Greek Council of State decisions in the form of a computer-accessible mediu...
Diomidis Spinellis
NIPS
2007
15 years 7 months ago
Gaussian Process Models for Link Analysis and Transfer Learning
In this paper we model relational random variables on the edges of a network using Gaussian processes (GPs). We describe appropriate GP priors, i.e., covariance functions, for dir...
Kai Yu, Wei Chu
ESANN
2004
15 years 7 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...
128
Voted
AAAI
1994
15 years 7 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter