Sciweavers

7776 search results - page 1132 / 1556
» Maintaining Maintainability
Sort
View
IPL
2007
101views more  IPL 2007»
15 years 6 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
BC
2005
106views more  BC 2005»
15 years 6 months ago
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
Abstract We model the dynamical behavior of the neuropil, the densely interconnected neural tissue in the cortex, using neuropercolation approach. Neuropercolation generalizes phas...
Robert Kozma, Marko Puljic, Paul Balister, B&eacut...
IPM
2007
123views more  IPM 2007»
15 years 6 months ago
Using query logs to establish vocabularies in distributed information retrieval
Users of search engines express their needs as queries, typically consisting of a small number of terms. The resulting search engine query logs are valuable resources that can be ...
Milad Shokouhi, Justin Zobel, Seyed M. M. Tahaghog...
BIB
2005
149views more  BIB 2005»
15 years 6 months ago
Biomolecular Interaction Network Database
The Biomolecular Interaction Network Database (BIND) (http://bind.ca) archives biomolecular interaction, reaction, complex and pathway information. Our aim is to curate the detail...
Don Gilbert
ISCI
2007
99views more  ISCI 2007»
15 years 6 months ago
Privacy-preserving algorithms for distributed mining of frequent itemsets
Standard algorithms for association rule mining are based on identification of frequent itemsets. In this paper, we study how to maintain privacy in distributed mining of frequen...
Sheng Zhong
« Prev « First page 1132 / 1556 Last » Next »