Sciweavers

5210 search results - page 845 / 1042
» Exact geometric computation
Sort
View
ICALP
2009
Springer
14 years 5 months ago
Qualitative Concurrent Stochastic Games with Imperfect Information
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
Vincent Gripon, Olivier Serre
IPSN
2009
Springer
14 years 5 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
P2P
2009
IEEE
121views Communications» more  P2P 2009»
14 years 4 months ago
Exploring the Optimal Chunk Selection Policy for Data-Driven P2P Streaming Systems
Data-driven P2P streaming systems can potentially provide good playback rate to a large number of viewers. One important design problem in such P2P systems is to determine the opt...
Bridge Q. Zhao, John Chi-Shing Lui, Dah-Ming Chiu
CIKM
2009
Springer
14 years 4 months ago
Frequent subgraph pattern mining on uncertain graph data
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 4 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra