Sciweavers

2635 search results - page 411 / 527
» Algorithms for the Database Layout Problem
Sort
View
CORR
2011
Springer
161views Education» more  CORR 2011»
14 years 11 months ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...
FOCS
2008
IEEE
15 years 10 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
BMCBI
2008
122views more  BMCBI 2008»
15 years 4 months ago
Grammar-based distance in progressive multiple sequence alignment
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
David J. Russell, Hasan H. Otu, Khalid Sayood
ICCV
2009
IEEE
16 years 9 months ago
Non-Negative Matrix Factorization of Partial Track Data for Motion Segmentation
This paper addresses the problem of segmenting lowlevel partial feature point tracks belonging to multiple motions. We show that the local velocity vectors at each instant of th...
Anil M. Cheriyadat and Richard J. Radke
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
16 years 4 months ago
Fast vertical mining using diffsets
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
Mohammed Javeed Zaki, Karam Gouda