Sciweavers

664 search results - page 20 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
KR
2010
Springer
15 years 2 months ago
A Correctness Result for Reasoning about One-Dimensional Planning Problems
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
Yuxiao Hu, Hector J. Levesque
AIRWEB
2007
Springer
15 years 4 months ago
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of ...
Josiane Xavier Parreira, Debora Donato, Carlos Cas...
PAMI
2007
154views more  PAMI 2007»
14 years 9 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...