Search Results for author:
Found 9 papers, 5 papers with code
Finding Relevant Points for Nearest-Neighbor Classification
We provide a simple algorithm for thinning a training set down to its subset of relevant points, using as subroutines algorithms for finding the minimum spanning tree of a set of points and for finding the extreme points (convex hull vertices) of a set of points.
Making Change in 2048
A widely-followed strategy in 2048 maintains tiles that represent the move number in binary notation, and a similar strategy in the Fibonacci number variant of the game (987) maintains the Zeckendorf representation of the move number as a sum of the fewest possible Fibonacci numbers; our analysis shows that the ability to follow these strategies is intimately connected with the fact that greedy change-making is optimal for binary and Fibonacci coinage.
Discrete Mathematics
Defining Equitable Geographic Districts in Road Networks via Stable Matching
In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling place, and all other network vertices must be labeled with the center to which they are associated.
Data Structures and Algorithms
Models and Algorithms for Graph Watermarking
We introduce models and algorithmic foundations for graph watermarking.
Multimedia Data Structures and Algorithms
Listing All Maximal Cliques in Large Sparse Real-World Graphs
We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, L\"offler, and Strash (ISAAC 2010) and analyze its performance on a large corpus of real-world graphs.
Data Structures and Algorithms F.2.2; G.2.2
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
The degeneracy of an $n$-vertex graph $G$ is the smallest number $d$ such that every subgraph of $G$ contains a vertex of degree at most $d$.
Data Structures and Algorithms Discrete Mathematics F.2.2; G.2.2
Small Maximal Independent Sets and Faster Exact Graph Coloring
We show that, for any n-vertex graph G and integer parameter k, there are at most 3^{4k-n}4^{n-3k} maximal independent sets I \subset G with |I| <= k, and that all such sets can be listed in time O(3^{4k-n} 4^{n-3k}).
Data Structures and Algorithms Combinatorics F.2.2
3-Coloring in Time O(1.3289^n)
We give a fast algorithm for (3, 2)-CSP and use it to improve the time bounds for solving the other problems listed above.
Data Structures and Algorithms F.2.2
Searching for Spaceships
We describe software that searches for spaceships in Conway's Game of Life and related two-dimensional cellular automata.
