Sciweavers

446 search results - page 53 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
PODC
2009
ACM
14 years 8 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 11 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
IROS
2006
IEEE
134views Robotics» more  IROS 2006»
14 years 1 months ago
A Novel Self Organizing Network to Perform Fast Moving Object Extraction from Video Streams
— Image segmentation is a critical task in computer vision. In the context of motion detection, a very popular segmentation approach is background substraction which consists in ...
Dizan Vasquez, Thierry Fraichard
ICCAD
2003
IEEE
193views Hardware» more  ICCAD 2003»
14 years 25 days ago
FROSTY: A Fast Hierarchy Extractor for Industrial CMOS Circuits
: This paper presents FROSTY, a computer program for automatically extracting the hierarchy of a large-scale digital CMOS circuit from its transistor-level netlist description and ...
Lei Yang, C.-J. Richard Shi
ICMCS
2000
IEEE
94views Multimedia» more  ICMCS 2000»
13 years 12 months ago
DCT Coefficient-Based Error Detection Technique for Compressed Video Stream
: In the process of transmission of digital encoded video bit streams over physical network, the data is corrupted by random bit errors, which has a several effect on the decoded v...
K. Bhattacharyya, H. S. Jamadagni