Sciweavers

415 search results - page 57 / 83
» Optimal query complexity bounds for finding graphs
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 7 months ago
Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
Pascal Pons
TCAD
2008
106views more  TCAD 2008»
13 years 7 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
AAAI
2010
13 years 9 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
13 years 7 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
AIEDAM
2007
90views more  AIEDAM 2007»
13 years 7 months ago
Assembly synthesis with subassembly partitioning for optimal in-process dimensional adjustability
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
Byungwoo Lee, Kazuhiro Saitou