Sciweavers

14518 search results - page 22 / 2904
» Two Problems for Sophistication
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 9 months ago
Improved results for directed multicut
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
Anupam Gupta
VLDB
2002
ACM
114views Database» more  VLDB 2002»
13 years 7 months ago
SMART: Making DB2 (More) Autonomic
IBM's SMART (Self-Managing And Resource Tuning) project aims to make DB2 selfmanaging, i.e. autonomic, to decrease the total cost of ownership and penetrate new markets. Over...
Guy M. Lohman, Sam Lightstone
NIPS
1996
13 years 9 months ago
Transformation Invariance in Pattern Recognition-Tangent Distance and Tangent Propagation
In pattern recognition, statistical modeling, or regression, the amount of data is a critical factor affecting the performance. If the amount of data and computational resources ar...
Patrice Simard, Yann LeCun, John S. Denker, Bernar...
JAIR
1998
92views more  JAIR 1998»
13 years 7 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
CVPR
2009
IEEE
15 years 2 months ago
Localized Content-Based Image Retrieval Through Evidence Region Identification
Over the past decade, multiple-instance learning (MIL) has been successfully utilized to model the localized content-based image retrieval (CBIR) problem, in which a bag corresp...
Wu-Jun Li (Hong Kong University of Science and Tec...