Sciweavers

19700 search results - page 3575 / 3940
» DNA-Based Computation Times
Sort
View
ATAL
2003
Springer
16 years 3 days ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara
238
Voted
ECCV
2010
Springer
16 years 3 days ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
ICS
2003
Tsinghua U.
16 years 2 days ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas
151
Voted
AINA
2010
IEEE
15 years 12 months ago
Encoding and Compression for the Devices Profile for Web Services
—Most solutions for Wireless Sensor Networks (WSN) come equipped with their own architectural concepts which raise the problem of possible incompatibility of computer networks an...
Guido Moritz, Dirk Timmermann, Regina Stoll, Frank...
DATE
2010
IEEE
140views Hardware» more  DATE 2010»
15 years 12 months ago
Variation-aware interconnect extraction using statistical moment preserving model order reduction
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
Tarek A. El-Moselhy, Luca Daniel
« Prev « First page 3575 / 3940 Last » Next »