Sciweavers

259 search results - page 23 / 52
» Graph Distances in the Data-Stream Model
Sort
View
MMS
2006
13 years 8 months ago
View-invariant motion trajectory-based activity classification and recognition
Motion trajectories provide rich spatio-temporal information about an object's activity. The trajectory information can be obtained using a tracking algorithm on data streams ...
Faisal I. Bashir, Ashfaq A. Khokhar, Dan Schonfeld
FCS
2009
13 years 6 months ago
Circuits as a Classifier for Small-World Network Models
The number and length distribution of circuits or loops in a graph or network give important insights into its key characteristics. We discuss the circuit properties of various sm...
Arno Leist, Kenneth A. Hawick
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 8 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 1 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
CP
2011
Springer
12 years 8 months ago
CP Models for Maximum Common Subgraph Problems
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
Samba Ndojh Ndiaye, Christine Solnon