Sciweavers

2516 search results - page 460 / 504
» When is there a representer theorem
Sort
View
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 7 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
14 years 7 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
CVPR
2010
IEEE
14 years 5 months ago
Estimating Optical Properties of Layered Surfaces Using the Spider Model
Many object surfaces are composed of layers of different physical substances, known as layered surfaces. These surfaces, such as patinas, water colors, and wall paintings, have mo...
Tetsuro Morimoto, Robby Tan, Rei Kawakami, Katsush...
TACAS
2010
Springer
241views Algorithms» more  TACAS 2010»
14 years 4 months ago
Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions
Abstract. The Real-Time Calculus (RTC) [16] is a framework to analyze heterogeneous real-time systems that process event streams of data. The streams are characterized by pairs of ...
Matthieu Moy, Karine Altisen
CICLING
2010
Springer
14 years 4 months ago
An Experimental Study on Unsupervised Graph-based Word Sense Disambiguation
Recent research works on unsupervised word sense disambiguation report an increase in performance, which reduces their handicap from the respective supervised approaches for the sa...
George Tsatsaronis, Iraklis Varlamis, Kjetil N&osl...