Sciweavers

1058 search results - page 120 / 212
» It's Doomed; We Can Prove It
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
14 years 3 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
FOCS
2002
IEEE
14 years 3 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
CSL
1999
Springer
14 years 2 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx
CVPR
2010
IEEE
14 years 1 months ago
Metric-Induced Optimal Embedding for Intrinsic 3D Shape Analysis
For various 3D shape analysis tasks, the LaplaceBeltrami(LB) embedding has become increasingly popular as it enables the efficient comparison of shapes based on intrinsic geometry...
Rongjie Lai, Yonggang Shi, Kevin Scheibel, Scott F...
NIPS
2008
13 years 11 months ago
Inferring rankings under constrained sensing
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
Srikanth Jagabathula, Devavrat Shah