Sciweavers

5539 search results - page 50 / 1108
» What can be computed locally
Sort
View
FTDCS
2004
IEEE
14 years 1 months ago
Friendly Object Tracking and Foreign Object Detection and Localization with an SDAC Wireless Sensor Network
This paper presents a proof-of-concept wireless sensor network for detecting and tracking friendly objects and detecting and localizing foreign objects. The network incorporates a...
Douglas Stark, Jesse Davis
SC
2005
ACM
14 years 3 months ago
Integrated Loop Optimizations for Data Locality Enhancement of Tensor Contraction Expressions
A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem ...
Swarup Kumar Sahoo, Sriram Krishnamoorthy, Rajkira...
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
14 years 3 months ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy
ICCV
2005
IEEE
14 years 12 months ago
Sparse Image Coding Using a 3D Non-Negative Tensor Factorization
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the pas...
Tamir Hazan, Simon Polak, Amnon Shashua
ACG
2006
Springer
14 years 3 months ago
Recognizing Seki in Computer Go
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an...
Xiaozhen Niu, Akihiro Kishimoto, Martin Mülle...