Sciweavers

1629 search results - page 102 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
ICMCS
2007
IEEE
288views Multimedia» more  ICMCS 2007»
15 years 1 months ago
Network Lifetime Maximization in Wireless Visual Sensor Networks using a Distributed Algorithm
Network lifetime maximization is a critical issue in wireless sensor networks since each sensor has a limited energy supply. Different from conventional sensors, video sensors com...
Yifeng He, Ivan Lee, Ling Guan
ISSS
2000
IEEE
127views Hardware» more  ISSS 2000»
15 years 2 months ago
Lower Bound Estimation for Low Power High-Level Synthesis
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Sta...
DCC
2008
IEEE
14 years 11 months ago
Design and Implementation of a High-Performance Microprocessor Cache Compression Algorithm
Researchers have proposed using hardware data compression units within the memory hierarchies of microprocessors in order to improve performance, energy efficiency, and functional...
Xi Chen, Lei Yang, Haris Lekatsas, Robert P. Dick,...
ECCV
2006
Springer
15 years 12 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
NJC
2000
99views more  NJC 2000»
14 years 9 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne