706 search results - page 134 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
CF
2007
ACM
13 years 11 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
TSP
2008
13 years 7 months ago
2008
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
CGF
2004
13 years 7 months ago
2004
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...