Sciweavers

2981 search results - page 381 / 597
» Word Sense and Subjectivity
Sort
View
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
16 years 24 days ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
DRM
2007
Springer
16 years 24 days ago
Digital rights management: desirable, inevitable, and almost irrelevant
provides a very brief overview of some of the main points. References are given to my papers, where those points are explained in more detail, and citations are provided to the ext...
Andrew M. Odlyzko
ICALP
2007
Springer
16 years 23 days ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
MLMI
2007
Springer
16 years 23 days ago
Towards an Objective Test for Meeting Browsers: The BET4TQB Pilot Experiment
This paper outlines first the BET method for task-based evaluation of meeting browsers. ‘Observations of interest’ in meetings are empirically determined by neutral observers ...
Andrei Popescu-Belis, Philippe Baudrion, Mike Flyn...
TARK
2007
Springer
16 years 22 days ago
A normal simulation of coalition logic and an epistemic extension
In this paper we show how coalition logic can be reduced to the fusion of a normal modal STIT logic for agency and a standard normal temporal logic for discrete time, and how this...
Jan Broersen, Andreas Herzig, Nicolas Troquard