Sciweavers

275 search results - page 44 / 55
» On the computational power of iterative auctions
Sort
View
RTA
2005
Springer
15 years 3 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
PC
2010
196views Management» more  PC 2010»
14 years 8 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
ICIP
2008
IEEE
15 years 11 months ago
LASIC: A model invariant framework for correspondence
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...
Bernardo Rodrigues Pires, João Xavier, Jos&...
PERCOM
2008
ACM
15 years 9 months ago
Stability and Delay Analysis for Multi-Hop Single-Sink Wireless Sensor Networks
Wireless sensor networks are commonly used to monitor and control the physical world. To provide a meaningful service such as disaster and emergency surveillance, meeting real-tim...
Muhammad Farukh Munir, Arzad Alam Kherani, Fethi F...
ICCAD
2005
IEEE
107views Hardware» more  ICCAD 2005»
15 years 6 months ago
Projection-based performance modeling for inter/intra-die variations
Large-scale process fluctuations in nano-scale IC technologies suggest applying high-order (e.g., quadratic) response surface models to capture the circuit performance variations....
Xin Li, Jiayong Le, Lawrence T. Pileggi, Andrzej J...