Sciweavers

1529 search results - page 164 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
COMPGEOM
2010
ACM
15 years 9 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
PRICAI
2004
Springer
15 years 9 months ago
The Happy Searcher: Challenges in Web Information Retrieval
Search has arguably become the dominant paradigm for finding information on the World Wide Web. In order to build a successful search engine, there are a number of challenges that ...
Mehran Sahami, Vibhu O. Mittal, Shumeet Baluja, He...
TIT
2002
65views more  TIT 2002»
15 years 4 months ago
On the importance of combining wavelet-based nonlinear approximation with coding strategies
This paper provides a mathematical analysis of transform compression in its relationship to linear and nonlinear approximation theory. Contrasting linear and nonlinear approximatio...
Albert Cohen, Ingrid Daubechies, Onur G. Guleryuz,...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
16 years 4 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
SPIN
2000
Springer
15 years 8 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai