Sciweavers

5022 search results - page 250 / 1005
» Data structures and problem solving using Java
Sort
View
144
Voted
NIPS
2007
15 years 4 months ago
Multi-Task Learning via Conic Programming
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama, ...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 4 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
15 years 8 months ago
Minimum Enclosing Spheres Formulations for Support Vector Ordinal Regression
We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. B...
Shirish Krishnaj Shevade, Wei Chu
114
Voted
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
15 years 8 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
155
Voted
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 6 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula