Sciweavers

2457 search results - page 264 / 492
» Local Search with Bootstrapping
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
An L1 criterion for dictionary learning by subspace identification
We propose an ℓ1 criterion for dictionary learning for sparse signal representation. Instead of directly searching for the dictionary vectors, our dictionary learning approach i...
Florent Jaillet, Rémi Gribonval, Mark D. Pl...
DCG
2010
137views more  DCG 2010»
15 years 4 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
COLING
2002
15 years 4 months ago
Location Normalization for Information Extraction
Ambiguity is very high for location names. For example, there are 23 cities named `Buffalo' in the U.S. Country names such as `Canada', `Brazil' and `China' ar...
Huifeng Li, Rohini K. Srihari, Cheng Niu, Wei Li 0...
NLE
2010
218views more  NLE 2010»
15 years 3 months ago
Automatic discovery of word semantic relations using paraphrase alignment and distributional lexical semantics analysis
Thesauri, that list the most salient semantic relations between words have mostly been compiled manually. Therefore, the inclusion of an entry depends on the subjective decision o...
Gaël Dias, Rumen Moraliyski, João Cord...
160
Voted
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 3 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani