Sciweavers

100 search results - page 3 / 20
» A distance-labelling problem for hypercubes
Sort
View
DM
2006
132views more  DM 2006»
14 years 11 months ago
Recursive fault-tolerance of Fibonacci cube in hypercubes
Fibonacci cube is a subgraph of hypercube induced on vertices without two consecutive 1's. If we remove from Fibonacci cube the vertices with 1 both in the first and the last...
Petr Gregor
84
Voted
JCT
1998
99views more  JCT 1998»
14 years 11 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
14 years 11 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
15 years 6 months ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
CVPR
2011
IEEE
14 years 7 months ago
Iterative Quantization: A Procrustean Approach to Learning Binary Codes
This paper addresses the problem of learning similaritypreserving binary codes for efficient retrieval in large-scale image collections. We propose a simple and efficient altern...
Yunchao Gong, Svetlana Lazebnik