Sciweavers

11381 search results - page 2221 / 2277
» Connectivity
Sort
View
ATMOS
2010
183views Optimization» more  ATMOS 2010»
14 years 8 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
CIKM
2010
Springer
14 years 8 months ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu
CIKM
2010
Springer
14 years 8 months ago
Mining interesting link formation rules in social networks
Link structures are important patterns one looks out for when modeling and analyzing social networks. In this paper, we propose the task of mining interesting Link Formation rules...
Cane Wing-ki Leung, Ee-Peng Lim, David Lo, Jianshu...
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 8 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
CORR
2010
Springer
58views Education» more  CORR 2010»
14 years 8 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
« Prev « First page 2221 / 2277 Last » Next »