Sciweavers

9842 search results - page 1914 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 7 months ago
Supporting Time-Constrained SQL Queries in Oracle
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
14 years 7 months ago
Discovering topical structures of databases
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
Wensheng Wu, Berthold Reinwald, Yannis Sismanis, R...
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 7 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
SIGMOD
2007
ACM
153views Database» more  SIGMOD 2007»
14 years 7 months ago
Scaling games to epic proportion
We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI)...
Walker M. White, Alan J. Demers, Christoph Koch, J...
SIGMOD
2006
ACM
106views Database» more  SIGMOD 2006»
14 years 7 months ago
Run-time operator state spilling for memory intensive long-running queries
Main memory is a critical resource when processing longrunning queries over data streams with state intensive operators. In this work, we investigate state spill strategies that h...
Bin Liu, Yali Zhu, Elke A. Rundensteiner
« Prev « First page 1914 / 1969 Last » Next »