Sciweavers

2043 search results - page 403 / 409
» Some Basics on Tolerances
Sort
View
FSTTCS
2010
Springer
13 years 6 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
FSTTCS
2010
Springer
13 years 6 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
ICDE
2010
IEEE
220views Database» more  ICDE 2010»
13 years 6 months ago
Profiling linked open data with ProLOD
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
Christoph Böhm, Felix Naumann, Ziawasch Abedj...
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 6 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
ICWSM
2009
13 years 6 months ago
From Generating to Mining: Automatically Scripting Conversations Using Existing Online Sources
Hearing people argue opposing sides of an issue can be a useful way to understand the topic; however, these debates or conversations often don't exist. Unfortunately, generat...
Nathan D. Nichols, Lisa M. Gandy, Kristian J. Hamm...