Sciweavers

1076 search results - page 67 / 216
» Operations on proofs and labels
Sort
View
ISDA
2010
IEEE
13 years 6 months ago
Feature selection is the ReliefF for multiple instance learning
Dimensionality reduction and feature selection in particular are known to be of a great help for making supervised learning more effective and efficient. Many different feature sel...
Amelia Zafra, Mykola Pechenizkiy, Sebastián...
FSEN
2009
Springer
14 years 3 months ago
Program Logics for Sequential Higher-Order Control
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
Martin Berger
PODC
2010
ACM
14 years 24 days ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
COMPGEOM
1999
ACM
14 years 1 months ago
Mesh Collapse Compression
We present a novel algorithm for encoding the topology of triangular meshes. A sequence of edge contract and divide operations collapses the entire mesh into a single vertex. This ...
Martin Isenburg, Jack Snoeyink
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 2 months ago
Derandomized Squaring of Graphs
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
Eyal Rozenman, Salil P. Vadhan