1594 search results - page 286 / 319 » An Algorithm to Compute Collusion Paths |
112
click to vote
NRHM
2000
14 years 11 months ago
2000
There are a number of different approaches for automatically selecting video clips from a video database and sequencing them into meaningful presentations for viewers. The video d...
TCAD
2002
14 years 11 months ago
2002
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...
110
click to vote
ATMOS
2010
14 years 10 months ago
2010
Train Routing is a problem that arises in the early phase of the passenger railway planning process, usually several months before operating the trains. The main goal is to assign...
102
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
120
click to vote
TPDS
2010
14 years 10 months ago
2010
—Due to a continued increase in the speed and capacities of computing devices, combined with our society’s growing need for mobile communication capabilities, multihop wireless...