Sciweavers

171 search results - page 32 / 35
» Maximally fast and arbitrarily fast implementation of linear...
Sort
View
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
14 years 28 days ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
IJON
1998
172views more  IJON 1998»
13 years 7 months ago
Blind separation of convolved mixtures in the frequency domain
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
Paris Smaragdis
SMA
2008
ACM
157views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Interactive physically-based shape editing
We present an alternative approach to standard geometric shape editing using physically-based simulation. With our technique, the user can deform complex objects in real-time. The...
Johannes Mezger, Bernhard Thomaszewski, Simon Pabs...
VLSID
2001
IEEE
184views VLSI» more  VLSID 2001»
14 years 8 months ago
Battery Life Estimation of Mobile Embedded Systems
Since battery life directly impacts the extent and duration of mobility, one of the key considerations in the design of a mobile embedded system should be to maximize the energy d...
Debashis Panigrahi, Sujit Dey, Ramesh R. Rao, Kani...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 2 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...