Sciweavers

ICML
2010
IEEE
13 years 5 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre
AAAI
1994
13 years 5 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
IJCAI
1997
13 years 5 months ago
On the Efficient Classification of Data Structures by Neural Networks
Marco Gori Dipartimento di Ingegneria deU'Informazione Universita di Siena Via Roma 56 53100 Siena, Italy Alessandro Sperduti Dipartimento di Informatica Universita di Pisa C...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
AAAI
2000
13 years 5 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
CGVR
2006
13 years 5 months ago
Image Reconstruction Scheme for Watersheds based Video Segmentation
- In this paper, we proposed a new solution to the reconstruction of image in order to solve the oversegmentation problem of watershed transformation which is widely used as an ima...
Hyun Sil Sin, Hyun Woo Park, Hwang Kyu Yang, Tae S...
NIPS
2007
13 years 6 months ago
Convex Relaxations of Latent Variable Training
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
Yuhong Guo, Dale Schuurmans
ICRA
2000
IEEE
136views Robotics» more  ICRA 2000»
13 years 9 months ago
Registration of Range Data Using a Hybrid Simulated Annealing and Iterative Closest Point Algorithm
The need to register data is abundant in applications such as: world modeling, part inspection and manufacturing, object recognition, pose estimation, robotic navigation, and reve...
Jason P. Luck, Charles Q. Little, William Hoff
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
13 years 9 months ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
SAT
2005
Springer
95views Hardware» more  SAT 2005»
13 years 10 months ago
Random Walk with Continuously Smoothed Variable Weights
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
Steven David Prestwich
EMMCVPR
2005
Springer
13 years 10 months ago
A New Implicit Method for Surface Segmentation by Minimal Paths: Applications in 3D Medical Images
Abstract. We introduce a novel implicit approach for single object segmentation in 3D images. The boundary surface of this object is assumed to contain two known curves (the constr...
Roberto Ardon, Laurent D. Cohen, Anthony J. Yezzi