Sciweavers

7303 search results - page 428 / 1461
» Optimality for dynamic patterns
Sort
View
KDD
2008
ACM
284views Data Mining» more  KDD 2008»
16 years 7 months ago
Community evolution in dynamic multi-mode networks
A multi-mode network typically consists of multiple heterogeneous social actors among which various types of interactions could occur. Identifying communities in a multi-mode netw...
Lei Tang, Huan Liu, Jianping Zhang, Zohreh Nazeri
DATE
2007
IEEE
95views Hardware» more  DATE 2007»
16 years 1 months ago
Memory bank aware dynamic loop scheduling
In a parallel system with multiple CPUs, one of the key problems is to assign loop iterations to processors. This problem, known as the loop scheduling problem, has been studied i...
Mahmut T. Kandemir, Taylan Yemliha, Seung Woo Son,...
GLOBECOM
2007
IEEE
16 years 1 months ago
Dynamic Multipath Onion Routing in Anonymous Peer-To-Peer Overlay Networks
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
Olaf Landsiedel, Lexi Pimenidis, Klaus Wehrle, Hei...
ICPP
2003
IEEE
16 years 2 days ago
Dynamic Control Frames in Reservation-Based Packet Scheduling for Single-Hop WDM Networks
In reservation-based packet scheduling algorithms for single-hop WDM networks, one of the wavelengths is used as a control channel which is shared by all of the nodes for transmit...
Hwa-Chun Lin, Pei-Shin Liu
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 11 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers