Sciweavers

5138 search results - page 531 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ECCC
2000
93views more  ECCC 2000»
15 years 6 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
MVA
2007
158views Computer Vision» more  MVA 2007»
15 years 6 months ago
Hybrid object labelling in digital images
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
Julio Martín-Herrero
PAMI
2007
166views more  PAMI 2007»
15 years 6 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
SADM
2008
90views more  SADM 2008»
15 years 6 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...
TALG
2010
74views more  TALG 2010»
15 years 5 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan