Sciweavers

2354 search results - page 403 / 471
» A Common-Sense Theory of Time
Sort
View
ICALP
2011
Springer
13 years 23 days 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 4 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 3 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...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 11 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...