Sciweavers

2254 search results - page 85 / 451
» Computing the minimal covering set
Sort
View
131
Voted
ECCC
2006
109views more  ECCC 2006»
15 years 21 days ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
ECCV
2006
Springer
16 years 2 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
89
Voted
CLUSTER
2008
IEEE
15 years 2 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
120
Voted
FOCS
2008
IEEE
15 years 7 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
TOG
2002
102views more  TOG 2002»
15 years 9 days ago
Hierarchical pattern mapping
We present a multi-scale algorithm for mapping a texture defined by an input image onto an arbitrary surface. It avoids the generation and storage of a new, specific texture. The ...
Cyril Soler, Marie-Paule Cani, Alexis Angelidis