Sciweavers

3229 search results - page 577 / 646
» The Theory of Timed Automata
Sort
View
ICALP
2011
Springer
13 years 1 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
PODS
2011
ACM
220views Database» more  PODS 2011»
13 years 15 days ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
SIGIR
2011
ACM
13 years 14 days ago
Utilizing marginal net utility for recommendation in e-commerce
Traditional recommendation algorithms often select products with the highest predicted ratings to recommend. However, earlier research in economics and marketing indicates that a ...
Jian Wang, Yi Zhang
ICDCS
2011
IEEE
12 years 9 months ago
Accuracy-Aware Interference Modeling and Measurement in Wireless Sensor Networks
Abstract—Wireless Sensor Networks (WSNs) are increasingly available for mission-critical applications such as emergency management and health care. To meet the stringent requirem...
Jun Huang, Shucheng Liu, Guoliang Xing, Hongwei Zh...
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 5 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat