Sciweavers

7167 search results - page 89 / 1434
» Answer Set Programming
Sort
View
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 9 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
COMPSAC
2010
IEEE
13 years 5 months ago
Representing and Reasoning about Web Access Control Policies
The advent of emerging technologies such as Web services, service-oriented architecture, and cloud computing has enabled us to perform business services more efficiently and effect...
Gail-Joon Ahn, Hongxin Hu, Joohyung Lee, Yunsong M...
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 8 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau
CRYPTOLOGIA
2007
53views more  CRYPTOLOGIA 2007»
13 years 7 months ago
Rejewski's Catalog
When attacking the German Enigma cipher machine during the 1930s, the Polish mathematician Marian Rejewski developed a catalog of disjoint cycles of permutations generated by Enigm...
Alex Kuhl
ISAAC
2005
Springer
135views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Embedding Point Sets into Plane Graphs of Small Dilation
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
Annette Ebbers-Baumann, Ansgar Grüne, Marek K...