Sciweavers

653 search results - page 7 / 131
» The size of minimum 3-trees
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
ISSS
1997
IEEE
102views Hardware» more  ISSS 1997»
15 years 1 months ago
An Efficient Model for DSP Code Generation: Performance, Code Size, Estimated Energy
This paper presents a model for simultaneous instruction selection, compaction, and register allocation. An arc mapping model along with logical propositions is used to create an ...
Catherine H. Gebotys
TCOM
2008
93views more  TCOM 2008»
14 years 9 months ago
Optimal Step-Size Constant Modulus Algorithm
The step size leading to the absolute minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a...
Vicente Zarzoso, Pierre Comon
CVPR
2010
IEEE
14 years 6 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
14 years 9 months ago
Sum List Coloring 2*n Arrays
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum...
Garth Isaak