Sciweavers

1208 search results - page 151 / 242
» Uniform eventown problems
Sort
View
KR
2004
Springer
15 years 10 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
AUSAI
2006
Springer
15 years 8 months ago
Robust Character Recognition Using a Hierarchical Bayesian Network
There is increasing evidence to suggest that the neocortex of the mammalian brain does not consist of a collection of specialised and dedicated cortical architectures, but instead ...
John Thornton, Torbjorn Gustafsson, Michael Blumen...
FOCS
2004
IEEE
15 years 8 months ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair
GD
2006
Springer
15 years 8 months ago
The Website for Graph Visualization Software References (GVSR)
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
Bruno Pinaud, Pascale Kuntz, Fabien Picarougne
SODA
2008
ACM
125views Algorithms» more  SODA 2008»
15 years 6 months ago
Ultra-low-dimensional embeddings for doubling metrics
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar