Sciweavers

3958 search results - page 212 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
CODES
2009
IEEE
15 years 10 months ago
Minimization of the reconfiguration latency for the mapping of applications on FPGA-based systems
Field-Programmable Gate Arrays (FPGAs) have become promising mapping fabric for the implementation of System-on-Chip (SoC) platforms, due to their large capacity and their enhance...
Vincenzo Rana, Srinivasan Murali, David Atienza, M...
ICPR
2006
IEEE
16 years 7 months ago
Multiple Objects Tracking with Multiple Hypotheses Graph Representation
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...
Alex Yong Sang Chia, Liyuan Li, Weimin Huang
PERCOM
2007
ACM
16 years 6 months ago
Supporting Pluggable Configuration Algorithms in PCOM
Pervasive Computing envisions distributed applications that optimally leverage the resources present in their ever-changing execution environment. To ease the development of perva...
Marcus Handte, Klaus Herrmann, Gregor Schiele, Chr...
IWPEC
2010
Springer
15 years 4 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
CATA
2003
15 years 8 months ago
More Accurate Semantics Defining Constraint Combination for Software Systems Having Client-Server Relationships
In this paper we present a new method of combining multiple precedence constraints for a single task to support software systems having client-server relationships. In these types...
Kenneth G. Ricks, David Jeff Jackson, B. Earl Well...