Sciweavers

1487 search results - page 23 / 298
» The Computational Complexity of Link Building
Sort
View
CVPR
2006
IEEE
14 years 2 months ago
Joint Recognition of Complex Events and Track Matching
We present a novel method for jointly performing recognition of complex events and linking fragmented tracks into coherent, long-duration tracks. Many event recognition methods re...
Michael T. Chan, Anthony Hoogs, Rahul Bhotika, A. ...
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 8 months ago
Detecting communities of triangles in complex networks using spectral optimization
The study of the sub-structure of complex networks is of major importance to relate topology and functionality. Many efforts have been devoted to the analysis of the modular struc...
Belkacem Serrour, Alex Arenas, Sergio Gómez
COGSCI
2010
160views more  COGSCI 2010»
13 years 8 months ago
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
Jakub Szymanik, Marcin Zajenkowski
PRL
2002
95views more  PRL 2002»
13 years 8 months ago
Dissimilarity representations allow for building good classifiers
In this paper, a classification task on dissimilarity representations is considered. A traditional way to discriminate between objects represented by dissimilarities is the neares...
Elzbieta Pekalska, Robert P. W. Duin
GLOBECOM
2006
IEEE
14 years 2 months ago
Link Performance Bounds in Homogeneous Optically Switched Ring Networks
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
Shujia Gong, Bijan Jabbari