Sciweavers

1327 search results - page 137 / 266
» Path following algorithm for the graph matching problem
Sort
View
TITS
2011
165views more  TITS 2011»
14 years 11 months ago
Robust Inference of Principal Road Paths for Intelligent Transportation Systems
Abstract—Over the last few years, electronic vehicle guidance systems have become increasingly more popular. However, despite their ubiquity, performance will always be subject t...
Gabriel Agamennoni, Juan Nieto, Eduardo Mario Nebo...
IPPS
2005
IEEE
15 years 9 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das
SPIRE
2010
Springer
15 years 2 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
172
Voted
MOBICOM
2006
ACM
15 years 10 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
DIS
2009
Springer
15 years 10 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han