Sciweavers

19866 search results - page 3678 / 3974
» Computing all factorizations in ***
Sort
View
CSDA
2007
136views more  CSDA 2007»
15 years 6 months ago
A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation
The maximum rank correlation (MRC) estimator was originally studied by Han [1987. Nonparametric analysis of a generalized regression model. J. Econometrics 35, 303–316] and Sher...
Hansheng Wang
GIS
2002
ACM
15 years 6 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
CJTCS
1999
133views more  CJTCS 1999»
15 years 6 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
CORR
1999
Springer
93views Education» more  CORR 1999»
15 years 6 months ago
On the Power of Positive Turing Reductions
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
Edith Hemaspaandra
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 6 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
« Prev « First page 3678 / 3974 Last » Next »