Sciweavers

932 search results - page 127 / 187
» Where in the Wikipedia Is That Answer
Sort
View
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
14 years 17 days ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
APWEB
2010
Springer
14 years 17 days ago
Crawling Online Social Graphs
—Extensive research has been conducted on top of online social networks (OSNs), while little attention has been paid to the data collection process. Due to the large scale of OSN...
Shaozhi Ye, Juan Lang, Shyhtsun Felix Wu
ICALP
2010
Springer
14 years 17 days ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
14 years 14 days ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff
SEMWEB
2009
Springer
14 years 9 days ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...