Sciweavers

42 search results - page 2 / 9
» On the Computational Complexity of Dominance Links in Gramma...
Sort
View
COGSCI
2004
105views more  COGSCI 2004»
13 years 5 months ago
Intention, interpretation and the computational structure of language
I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex repr...
Matthew Stone
DAGSTUHL
2006
13 years 7 months ago
Cognitive Vision Needs Attention to Link Sensing with Recognition
Abstract. "Cognitive computer vision is concerned with integration and control of vision systems using explicit but not necessarily symbolic models of context, situation and g...
John K. Tsotsos
IWCMC
2010
ACM
13 years 10 months ago
Estimating routing symmetry on single links by passive flow measurements
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
Wolfgang John, Maurizio Dusi, Kimberly C. Claffy
ICDE
2008
IEEE
150views Database» more  ICDE 2008»
14 years 7 months ago
Link Privacy in Social Networks
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the ty...
Aleksandra Korolova, Rajeev Motwani, Shubha U. Nab...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 4 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...