Sciweavers

1963 search results - page 238 / 393
» The Maximum Solution Problem on Graphs
Sort
View
PAMI
2007
154views more  PAMI 2007»
15 years 8 days ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
ADHOC
2005
95views more  ADHOC 2005»
15 years 20 days ago
Planar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Hannes Frey, Daniel Görgen
90
Voted
DATE
2006
IEEE
153views Hardware» more  DATE 2006»
15 years 6 months ago
Analyzing timing uncertainty in mesh-based clock architectures
Mesh architectures are used to distribute critical global signals on a chip, such as clock and power/ground. Redundancy created by mesh loops smooths out undesirable variations be...
Subodh M. Reddy, Gustavo R. Wilke, Rajeev Murgai
93
Voted
SMA
2005
ACM
104views Solid Modeling» more  SMA 2005»
15 years 6 months ago
Packing a trunk: now with a twist!
In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk...
Friedrich Eisenbrand, Stefan Funke, Andreas Karren...
119
Voted
FSTTCS
2008
Springer
15 years 1 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel