Sciweavers

515 search results - page 80 / 103
» Layouts of Expander Graphs
Sort
View
106
Voted
WWW
2010
ACM
15 years 7 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
SMI
2008
IEEE
110views Image Analysis» more  SMI 2008»
15 years 7 months ago
OCTOR: OCcurrence selecTOR in pattern hierarchies
Hierarchies of patterns of features, of sub-assemblies, or of CSG sub-expressions are used in architectural and mechanical CAD to eliminate laborious repetitions from the design p...
Justin Jang, Jarek Rossignac
92
Voted
EPIA
2001
Springer
15 years 5 months ago
A Temporal Planning System for Time-Optimal Planning
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
Antonio Garrido Tejero, Eva Onaindia, Federico Bar...
ICALP
2001
Springer
15 years 5 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
110
Voted
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
15 years 4 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla