Sciweavers

2080 search results - page 177 / 416
» Measuring empirical computational complexity
Sort
View
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
15 years 11 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
MBEC
2011
117views more  MBEC 2011»
14 years 7 months ago
Face activated neurodynamic cortical networks
Previous neuroimaging studies have shown that complex visual stimuli, such as faces, activate multiple brain regions, yet little is known on the dynamics and complexity of the acti...
Ana Susac, Risto J. Ilmoniemi, Douglas Ranken, Sel...
CVPR
2008
IEEE
16 years 7 months ago
Joint data alignment up to (lossy) transformations
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto
HCI
2009
15 years 2 months ago
Can Neurophysiologic Synchronies Provide a Platform for Adapting Team Performance?
We have explored using neurophysiologic patterns as an approach for developing a deeper understanding of how teams collaborate when solving time-critical, complex real-world proble...
Ronald H. Stevens, Trysha Galloway, Chris Berka, M...
AI
2006
Springer
15 years 5 months ago
Generating and evaluating evaluative arguments
Evaluative arguments are pervasive in natural human communication. In countless situations people attempt to advise or persuade their interlocutors that something is desirable (vs...
Giuseppe Carenini, Johanna D. Moore