Sciweavers

3353 search results - page 316 / 671
» Laver and set theory
Sort
View
CHI
2004
ACM
16 years 7 months ago
Pointing without a pointer
We present a method for performing selection tasks based on continuous control of multiple, competing agents who try to determine the user's intentions from their control beh...
John Williamson, Roderick Murray-Smith
POPL
2004
ACM
16 years 7 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 7 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 7 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
ALT
2009
Springer
16 years 3 months ago
Uncountable Automatic Classes and Learning
In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vac...
Sanjay Jain, Qinglong Luo, Pavel Semukhin, Frank S...