1578 search results - page 241 / 316 » Direct Routing: Algorithms and Complexity |
175
click to vote
ICDM
2009
IEEE
16 years 26 days ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
192
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
145
click to vote
ASPDAC
2005
ACM
15 years 11 months ago
2005
ACM
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
190
click to vote
ICALP
1993
Springer
15 years 10 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
202
click to vote
ICS
2007
Tsinghua U.
16 years 10 days ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...