Sciweavers

38 search results - page 7 / 8
» Contracting preference relations for database applications
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 8 months ago
Spotting out emerging artists using geo-aware analysis of P2P query strings
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
Noam Koenigstein, Yuval Shavitt, Tomer Tankel
ICDE
2002
IEEE
164views Database» more  ICDE 2002»
14 years 9 months ago
Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
Charu C. Aggarwal
CIKM
2010
Springer
13 years 6 months ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu
BMCBI
2004
106views more  BMCBI 2004»
13 years 7 months ago
ESTIMA, a tool for EST management in a multi-project environment
Background: Single-pass, partial sequencing of complementary DNA (cDNA) libraries generates thousands of chromatograms that are processed into high quality expressed sequence tags...
Charu G. Kumar, Richard LeDuc, George Gong, Levan ...