Sciweavers

915 search results - page 26 / 183
» Maximally Abstract Retrenchments
Sort
View
MMS
2000
13 years 7 months ago
Retrieval Scheduling for Collaborative Multimedia Presentations
Abstract. The single-system approach is no longer sufficient to handle the load on popular Internet servers, especially for those offering extensive multimedia content. Such servic...
Ping Bai, B. Prabhakaran, Aravind Srinivasan
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 7 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
20
Voted
TCAD
2002
93views more  TCAD 2002»
13 years 7 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
TELSYS
2002
104views more  TELSYS 2002»
13 years 7 months ago
The Analysis of Queues with Time-Varying Rates for Telecommunication Models
Abstract. Time dependent behavior has an impact on the performance of telecommunication models. Examples include: staffing a call center, pricing the inventory of private line serv...
William A. Massey
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 7 months ago
Performance of Interference Alignment in Clustered Wireless Ad Hoc Networks
Abstract--Spatial interference alignment among a finite number of users is investigated as a technique to increase the probability of successful transmission in an interference lim...
Roland Tresch, Maxime Guillaud