Sciweavers

9176 search results - page 369 / 1836
» algorithms 2010
Sort
View
ICASSP
2010
IEEE
15 years 5 months ago
A supervisory approach to semi-supervised clustering
We propose a new approach to semi-supervised clustering that utilizes boosting to simultaneously learn both a similarity measure and a clustering of the data from given instancele...
Bryan Conroy, Yongxin Taylor Xi, Peter J. Ramadge
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
16 years 12 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ENTCS
2007
108views more  ENTCS 2007»
15 years 7 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
TIFS
2010
135views more  TIFS 2010»
15 years 2 months ago
Distance Metric Learning for Content Identification
This paper considers a distance metric learning (DML) algorithm for a fingerprinting system, which identifies a query content by finding the fingerprint in the database (DB) that m...
Dalwon Jang, Chang Dong Yoo, Ton Kalker
EMNLP
2010
15 years 5 months ago
On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
Alexander M. Rush, David Sontag, Michael Collins, ...