Sciweavers

244 search results - page 32 / 49
» Balanced Cayley graphs and balanced planar graphs
Sort
View
COCOON
2005
Springer
14 years 3 months ago
Complexity and Approximation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
INFOCOM
1993
IEEE
14 years 2 months ago
Power-Optimal Layout of Passive, Single-Hop, Fiber-Optic Interconnections Whose Capacity Increases with the Number of Stations
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
Yitzhak Birk
AVI
2008
14 years 15 days ago
Visualizing antenna design spaces
This paper describes a long-term project exploring advanced visual interfaces for antenna design. MERL developed three successive prototypes that embodied an evolution towards lar...
Kent Wittenburg, Tom Lanning, Darren Leigh, Kathy ...
DAGSTUHL
2007
13 years 11 months ago
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
Bruno Simeone, Federica Ricca, Andrea Scozzari
DMDW
2001
194views Management» more  DMDW 2001»
13 years 11 months ago
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch