Sciweavers

3007 search results - page 280 / 602
» Linear Functional Fixed-points
Sort
View
126
Voted
CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
15 years 8 months ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
140
Voted
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 8 months ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
FOCS
1994
IEEE
15 years 8 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle
CVPR
2010
IEEE
15 years 4 months ago
GPCA with denoising: A moments-based convex approach
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
Necmiye Ozay, Mario Sznaier, Constantino M. Lagoa,...
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 4 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari