Sciweavers

4114 search results - page 294 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
JMLR
2010
151views more  JMLR 2010»
15 years 1 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
16 years 7 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
TKDE
2008
121views more  TKDE 2008»
15 years 6 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
ICDE
2003
IEEE
135views Database» more  ICDE 2003»
16 years 8 months ago
Discovery of High-Dimensional
Determining relationships such as functional or inclusion dependencies within and across databases is important for many applications in information integration. When such informa...
Andreas Koeller, Elke A. Rundensteiner
ICDCS
1998
IEEE
15 years 11 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen