Sciweavers

1089 search results - page 111 / 218
» Bounds on generalized Frobenius numbers
Sort
View
SECON
2008
IEEE
14 years 3 months ago
Per User Throughput in Large Wireless Networks
— Previous results show that a node’s throughput scales poorly as the network size increases when every node has traffic. However, in many cases, only a fraction of nodes in l...
Dan Xu, Xin Liu
AINA
2007
IEEE
14 years 3 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
ICCV
2005
IEEE
14 years 2 months ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu
IPPS
2003
IEEE
14 years 2 months ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
14 years 2 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha