Sciweavers

5653 search results - page 976 / 1131
» Distributed Conceptual Structures
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 6 months ago
A comparison of flexible schemas for software as a service
A multi-tenant database system for Software as a Service (SaaS) should offer schemas that are flexible in that they can be extended for different versions of the application and d...
Stefan Aulbach, Dean Jacobs, Alfons Kemper, Michae...
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 6 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
16 years 6 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
16 years 6 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo