Sciweavers

4047 search results - page 298 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
PAMI
2011
15 years 1 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
14 years 6 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
ICDE
2011
IEEE
235views Database» more  ICDE 2011»
14 years 10 months ago
Dealing proactively with data corruption: Challenges and opportunities
—The danger of production or backup data becoming corrupted is a problem that database administrators dread. This position paper aims to bring this problem to the attention of th...
Nedyalko Borisov, Shivnath Babu, NagaPramod Mandag...
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
16 years 7 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu