Sciweavers

925 search results - page 150 / 185
» A Solution to the Extended GCD Problem
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 9 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
MOBIHOC
2006
ACM
14 years 9 months ago
Algorithmic aspects of communication in ad-hoc networks with smart antennas
Smart antennas have gained significant importance in multihop wireless networks in recent years, because of their sophisticated signal processing capabilities that hold the potent...
Karthikeyan Sundaresan, Weizhao Wang, Stephan Eide...
LATIN
2010
Springer
14 years 2 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
TCAD
2002
135views more  TCAD 2002»
13 years 9 months ago
Area fill synthesis for uniform layout density
Chemical-mechanical polishing (CMP) and other manufacturing steps in very deep submicron VLSI have varying effects on device and interconnect features, depending on local character...
Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexande...