450 search results - page 65 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
SIGGRAPH
1993
ACM
15 years 3 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
107
click to vote
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
219
click to vote
COCOA
2011
Springer
13 years 11 months ago
2011
Springer
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
RAID
2004
Springer
15 years 5 months ago
2004
Springer
Worm detection systems have traditionally used global strategies and focused on scan rates. The noise associated with this approach requires statistical techniques and large data s...
106
click to vote
AINA
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper we present a low-complexity traffic prioritization strategy for video transmission using the H.264 scalable video coding (SVC) standard over 802.11e wireless networ...