Sciweavers

882 search results - page 146 / 177
» On the Hardness of Graph Isomorphism
Sort
View
KAIS
2010
139views more  KAIS 2010»
13 years 7 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
AMDO
2010
Springer
13 years 6 months ago
Compatible Particles for Part-Based Tracking
Particle Filter methods are one of the dominant tracking paradigms due to its ability to handle non-gaussian processes, multimodality and temporal consistency. Traditionally, the e...
Brais Martínez, Marc Vivet, Xavier Binefa
CONEXT
2010
ACM
13 years 6 months ago
Profiling-By-Association: a resilient traffic profiling solution for the internet backbone
Profiling Internet backbone traffic is becoming an increasingly hard problem since users and applications are avoiding detection using traffic obfuscation and encryption. The key ...
Marios Iliofotou, Brian Gallagher, Tina Eliassi-Ra...
OOPSLA
2010
Springer
13 years 6 months ago
A recommender for conflict resolution support in optimistic model versioning
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
Petra Brosch, Martina Seidl, Gerti Kappel
ECRTS
2009
IEEE
13 years 6 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner