Sciweavers

31 search results - page 6 / 7
» On Balls and Bins with Deletions
Sort
View
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
14 years 1 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
CIKM
2005
Springer
13 years 9 months ago
Handling frequent updates of moving objects
A critical issue in moving object databases is to develop appropriate indexing structures for continuously moving object locations so that queries can still be performed efficien...
Bin Lin, Jianwen Su
JMLR
2012
11 years 10 months ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
14 years 1 months ago
Update Conscious Bitmap Indices
Bitmap indices have been widely used in several domains such as data warehousing and scientific applications due to their efficiency in answering certain query types over large ...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 12 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang