Sciweavers

50 search results - page 7 / 10
» Approximation schemes for multidimensional packing
Sort
View
COCOA
2009
Springer
14 years 1 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
SEBD
2004
139views Database» more  SEBD 2004»
13 years 11 months ago
A New Histogram-based Technique for Compressing Multi-Dimensional Data
Abstract. The need to compress data into synopses of summarized information often arises in many application scenarios, where the aim is to retrieve aggregate data efficiently, pos...
Filippo Furfaro, Giuseppe M. Mazzeo, Domenico Sacc...
TWC
2008
87views more  TWC 2008»
13 years 9 months ago
Opportunistic Grassmannian Beamforming for Multiuser and Multiantenna Downlink Communications
Scheduling in a broadcast channel based on partial channel-state-information at the transmitter is carried out in an opportunistic way. In this paper, the number of generated beams...
Nizar Zorba, Ana I. Pérez-Neira
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 6 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
PODS
2005
ACM
96views Database» more  PODS 2005»
14 years 3 months ago
Space complexity of hierarchical heavy hitters in multi-dimensional data streams
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
John Hershberger, Nisheeth Shrivastava, Subhash Su...