Sciweavers

15 search results - page 2 / 3
» On enumeration of hypergroups of order 3
Sort
View
ICALP
2011
Springer
12 years 8 months ago
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
Arash Farzan, Shahin Kamali
DCC
2005
IEEE
14 years 4 months ago
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
Harri Haanpää, Petteri Kaski
JETC
2008
127views more  JETC 2008»
13 years 3 months ago
Automated module assignment in stacked-Vdd designs for high-efficiency power delivery
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
Yong Zhan, Sachin S. Sapatnekar
ECCV
2002
Springer
14 years 7 months ago
Transitions of the 3D Medial Axis under a One-Parameter Family of Deformations
The instabilities of the medial axis of a shape under deformations have long been recognized as a major obstacle to its use in recognition and other applications. These instabilit...
Peter J. Giblin, Benjamin B. Kimia
CCCG
2010
13 years 6 months ago
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
Zahed Rahmati, Alireza Zarei