18306 search results - page 352 / 3662 » Algorithmics in Exponential Time |
176
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
191
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--This paper explores the computation and communication overlap capabilities enabled by the new CORE-Direct hardware capabilities introduced in the InfiniBand (IB) Host Cha...
163
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
244
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
182
click to vote
FOCI
2007
IEEE
16 years 1 months ago
2007
IEEE
— Backpropagation through time is a very popular discrete-time recurrent neural network training algorithm. However, the computational time associated with the learning process t...