Sciweavers

617 search results - page 103 / 124
» Language Games, Natural and Artificial
Sort
View
ICALP
2010
Springer
14 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
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
GROUP
2003
ACM
14 years 3 months ago
Using cursor prediction to smooth telepointer jitter
Telepointers are an important type of embodiment in real-time distributed groupware. Telepointers can increase the presence of remote participants and can provide considerable awa...
Carl Gutwin, Jeff Dyck, Jennifer Burkitt
LFCS
2009
Springer
14 years 4 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
WWW
2004
ACM
14 years 10 months ago
Anti-aliasing on the web
It is increasingly common for users to interact with the web using a number of different aliases. This trend is a doubleedged sword. On one hand, it is a fundamental building bloc...
Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins