Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,366
Surface Simplification Using Quadric Error Metrics
"... Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplifi ..."
Abstract
-
Cited by 1174 (16 self)
- Add to MetaCart
Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface
Scalable molecular dynamics with NAMD.
- J Comput Chem
, 2005
"... Abstract: NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD scales to hundreds of processors on high-end parallel platforms, as well as tens of processors on low-cost commodity clusters, and also runs on individual desktop and la ..."
Abstract
-
Cited by 849 (63 self)
- Add to MetaCart
Abstract: NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD scales to hundreds of processors on high-end parallel platforms, as well as tens of processors on low-cost commodity clusters, and also runs on individual desktop
Random Early Detection Gateways for Congestion Avoidance.
- IEEELACM Transactions on Networking,
, 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract
-
Cited by 2716 (31 self)
- Add to MetaCart
-layer congestion control protocol such as TCP. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways. lNTRODucTION I N high
Model-Driven Data Acquisition in Sensor Networks
- IN VLDB
, 2004
"... Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor ..."
Abstract
-
Cited by 449 (36 self)
- Add to MetaCart
on several real-world sensor-network data sets, taking into account the real measured data and communication quality, demonstrating that our model-based approach provides a high-fidelity representation of the real phenomena and leads to significant performance gains versus traditional data acquisition
The Determinants of Credit Spread Changes.
- Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract
-
Cited by 422 (2 self)
- Add to MetaCart
are highly crosscorrelated, and principal components analysis implies they are mostly driven by a single common factor. Although we consider several macro-economic and financial variables as candidate proxies, we cannot explain this common systematic component. Our results suggest that monthly credit spread
Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels
- IEEE TRANS. SIGNAL PROCESSING
, 2004
"... The use of space-division multiple access (SDMA) in the downlink of a multiuser multiple-input, multiple-output (MIMO) wireless communications network can provide a substantial gain in system throughput. The challenge in such multiuser systems is designing transmit vectors while considering the co-c ..."
Abstract
-
Cited by 371 (29 self)
- Add to MetaCart
-channel interference of other users. Typical optimization problems of interest include the capacity problem—maximizing the sum information rate subject to a power constraint—or the power control problem—minimizing transmitted power such that a certain quality-of-service metric for each user is met. Neither
Multilevel hypergraph partitioning: Application in VLSI domain
- IEEE TRANS. VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS
, 1999
"... In this paper, we present a new hypergraphpartitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the origina ..."
Abstract
-
Cited by 315 (22 self)
- Add to MetaCart
as on the run time for a number of very large scale integration circuits. Our experiments show that our multilevel hypergraph-partitioning algorithm produces high-quality partitioning in a relatively small amount of time. The quality of the partitionings produced by our scheme are on the average 6%–23 % better
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NP-complete in general cases as well as in several restricted cases. Because of its key importance, this problem has been exte ..."
Abstract
-
Cited by 255 (0 self)
- Add to MetaCart
quality schedules with lower costs. In this paper, we present two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time, which are called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm
Real-Time, Continuous Level of Detail Rendering of Height Fields
, 1996
"... We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid representation, and employs a variable screen-space threshold to bound the maximum error of the projected image. A coarse lev ..."
Abstract
-
Cited by 296 (15 self)
- Add to MetaCart
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid representation, and employs a variable screen-space threshold to bound the maximum error of the projected image. A coarse
Providing Guaranteed Services Without Per Flow Management
"... Existing approaches for providing guaranteed services require routers to manage per flow states and perform per ow operations [9, 21]. Such a stateful network architecture is less scalable and robust than stateless network architectures like the original IP and the recently proposed Diffserv [3]. Ho ..."
Abstract
-
Cited by 303 (4 self)
- Add to MetaCart
or data planes) at core routers, but can implement guaranteed services with levels of exibility, utilization, and assurance similar to those that can be provided with per flow mechanisms. In this way we can simultaneously achieve high quality of service, high scalability and robustness. The key technique
Results 1 - 10
of
4,366
