Sciweavers

446 search results - page 63 / 90
» Extremal Stable Graphs
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
14 years 1 months ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
UAI
2008
13 years 10 months ago
Discovering Cyclic Causal Models by Independent Components Analysis
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
Gustavo Lacerda, Peter Spirtes, Joseph Ramsey, Pat...
FAST
2009
13 years 6 months ago
Causality-Based Versioning
Versioning file systems provide the ability to recover from a variety of failures, including file corruption, virus and worm infestations, and user mistakes. However, using versio...
Kiran-Kumar Muniswamy-Reddy, David A. Holland
ICWSM
2009
13 years 6 months ago
Targeting Sentiment Expressions through Supervised Ranking of Linguistic Configurations
User generated content is extremely valuable for mining market intelligence because it is unsolicited. We study the problem of analyzing users' sentiment and opinion in their...
Jason S. Kessler, Nicolas Nicolov