Sciweavers

1383 search results - page 276 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 22 days ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 22 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
ICCV
2011
IEEE
13 years 10 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
COCOA
2011
Springer
13 years 9 months ago
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-B...
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 5 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...