Sciweavers

1024 search results - page 12 / 205
» Value complete, column complete, predicate complete
Sort
View
GD
1998
Springer
14 years 2 months ago
Geometric Thickness of Complete Graphs
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
Michael B. Dillencourt, David Eppstein, Daniel S. ...
IRI
2008
IEEE
14 years 4 months ago
Robust integration of multiple information sources by view completion
There are many applications where multiple data sources, each with its own features, are integrated in order to perform an inference task in an optimal way. Researchers have shown...
Shankara B. Subramanya, Baoxin Li, Huan Liu
PODC
2004
ACM
14 years 3 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
PLDI
2010
ACM
14 years 7 months ago
Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
14 years 1 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...