Sciweavers

355 search results - page 41 / 71
» Simultaneous Matchings
Sort
View
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
16 years 3 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
122
Voted
SPIRE
2009
Springer
15 years 9 months ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...
148
Voted
STACS
2012
Springer
13 years 10 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
207
Voted
GIS
2008
ACM
16 years 3 months ago
Low-cost orthographic imagery
Commercial aerial imagery websites, such as Google Maps, MapQuest, Microsoft Virtual Earth, and Yahoo! Maps, provide high- seamless orthographic imagery for many populated areas, ...
Peter Pesti, Jeremy Elson, Jon Howell, Drew Steedl...
120
Voted
GD
2004
Springer
15 years 8 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah