Sciweavers

2778 search results - page 280 / 556
» Limit complexities revisited
Sort
View
SIGECOM
2004
ACM
129views ECommerce» more  SIGECOM 2004»
16 years 2 days ago
Evaluating example-based search tools
A crucial element in consumer electronic commerce is a catalog tool that not only finds the product for the user, but also convinces him that he has made the best choice. To do th...
Pearl Huan Z. Pu, Pratyush Kumar
SPAA
2004
ACM
16 years 2 days ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
15 years 11 months ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen
EICS
2009
ACM
15 years 11 months ago
StateStream: a developer-centric approach towards unifying interaction models and architecture
Complex and dynamic interaction behaviors in applications such as Virtual Reality (VR) systems are difficult to design and develop. Reasons for this include the complexity and lim...
Gerwin de Haan, Frits H. Post
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 10 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...