Sciweavers

3946 search results - page 595 / 790
» The computational complexity of choice sets
Sort
View
IPPS
1997
IEEE
15 years 10 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
IPPS
1996
IEEE
15 years 10 months ago
Kiloprocessor Extensions to SCI
To expand the Scalable Coherent Interface's (SCI) capabilities so it can be used to efficiently handle sharing in systems of hundreds or even thousands of processors, the SCI...
Stefanos Kaxiras
DAC
1996
ACM
15 years 10 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....
STACS
1994
Springer
15 years 10 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
ACCV
2009
Springer
15 years 10 months ago
Efficient Human Action Detection Using a Transferable Distance Function
Abstract. In this paper, we address the problem of efficient human action detection with only one template. We choose the standard slidingwindow approach to scan the template video...
Weilong Yang, Yang Wang 0003, Greg Mori