Sciweavers

264 search results - page 13 / 53
» First order LUB approximations: characterization and algorit...
Sort
View
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 1 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 9 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...
CSB
2003
IEEE
106views Bioinformatics» more  CSB 2003»
15 years 5 months ago
Reconstruction of Ancestral Gene Order after Segmental Duplication and Gene Loss
As gene order evolves through a variety of chromosomal rearrangements, conserved segments provide important insight into evolutionary relationships and functional roles of genes. ...
Jun Huan, Jan Prins, Wei Wang 0010, Todd J. Vision
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 3 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
ACL
2004
15 years 1 months ago
Deep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
Roger Levy, Christopher D. Manning