Sciweavers

2542 search results - page 154 / 509
» An Operational Definition of Context
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 7 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
RECOMB
2008
Springer
16 years 7 months ago
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
Anne Bergeron, Julia Mixtacki, Jens Stoye
ICALP
2009
Springer
16 years 7 months ago
Rate-Based Transition Systems for Stochastic Process Calculi
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition r...
Rocco De Nicola, Diego Latella, Michele Loreti, Mi...
ICIAP
2005
ACM
16 years 7 months ago
Scatter Search Particle Filter for 2D Real-Time Hands and Face Tracking
This paper presents the scatter search particle filter (SSPF) algorithm and its application to real-time hands and face tracking. SSPF combines sequential Monte Carlo (particle fil...
Antonio S. Montemayor, Juan José Pantrigo, ...
PERCOM
2008
ACM
16 years 6 months ago
High-level Programming Support for Robust Pervasive Computing Applications
In this paper, we present a domain-specific Interface Definition Language (IDL) and its compiler, dedicated to the development of pervasive computing applications. Our IDL provide...
Wilfried Jouve, Julien Lancia, Nicolas Palix, Char...