Sciweavers

6274 search results - page 254 / 1255
» From query complexity to computational complexity
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 5 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
BMCBI
2010
164views more  BMCBI 2010»
15 years 5 months ago
Flexible network reconstruction from relational databases with Cytoscape and CytoSQL
Background: Molecular interaction networks can be efficiently studied using network visualization software such as Cytoscape. The relevant nodes, edges and their attributes can be...
Kris Laukens, Jens Hollunder, Thanh Hai Dang, Geer...
MSR
2006
ACM
15 years 11 months ago
MAPO: mining API usages from open source repositories
To improve software productivity, when constructing new software systems, developers often reuse existing class libraries or frameworks by invoking their APIs. Those APIs, however...
Tao Xie, Jian Pei
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 10 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SEMWEB
2004
Springer
15 years 10 months ago
Dynamic Agent Composition from Semantic Web Services
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...
Michael Czajkowski, Anna L. Buczak, Martin O. Hofm...