Sciweavers

7840 search results - page 308 / 1568
» On generalized Ramsey numbers
Sort
View
SIGIR
2010
ACM
15 years 7 months ago
Can search systems detect users' task difficulty?: some behavioral signals
In this paper, we report findings on how user behaviors vary in tasks with different difficulty levels as well as of different types. Two behavioral signals: document dwell time a...
Jingjing Liu, Chang Liu, Jacek Gwizdka, Nicholas J...
AML
2008
66views more  AML 2008»
15 years 7 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 6 months ago
Formal Relationships Between Geometrical and Classical Models for Concurrency
A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality betwe...
Eric Goubault, Samuel Mimram
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Hitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra...
129
Voted
CORR
2010
Springer
71views Education» more  CORR 2010»
15 years 6 months ago
Cobham's theorem for substitutions
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper...
Fabien Durand