4110 search results - page 805 / 822 » Efficient algorithms for the 2-gathering problem |
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
KDD
2001
ACM
14 years 7 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
VLDB
2005
ACM
14 years 7 months ago
2005
ACM
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggr...
SIGMOD
2008
ACM
14 years 6 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...