Sciweavers

491 search results - page 53 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
13 years 12 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
BMCBI
2007
142views more  BMCBI 2007»
13 years 7 months ago
LinkHub: a Semantic Web system that facilitates cross-database queries and information retrieval in proteomics
nd: A key abstraction in representing proteomics knowledge is the notion of unique identifiers for individual entities (e.g. proteins) and the massive graph of relationships among...
Andrew K. Smith, Kei-Hoi Cheung, Kevin Y. Yip, Mar...
ICCS
2005
Springer
14 years 1 months ago
Querying a Bioinformatic Data Sources Registry with Concept Lattices
Abstract Bioinformatic data sources available on the web are multiple and heterogenous. The lack of documentation and the difficulty of interaction with these data banks require us...
Nizar Messai, Marie-Dominique Devignes, Amedeo Nap...
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
12 years 10 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
CP
2004
Springer
14 years 1 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith