Sciweavers

2830 search results - page 507 / 566
» No Science without Semantics
Sort
View
ICS
2003
Tsinghua U.
14 years 1 months ago
Reducing register ports using delayed write-back queues and operand pre-fetch
In high-performance wide-issue microprocessors the access time, energy and area of the register file are often critical to overall performance. This is because these pararmeters g...
Nam Sung Kim, Trevor N. Mudge
COMPGEOM
2010
ACM
14 years 26 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 19 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 18 days ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
14 years 18 days ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan