Sciweavers

11211 search results - page 345 / 2243
» Data Structures
Sort
View
IPL
2008
118views more  IPL 2008»
15 years 6 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
VLDB
2002
ACM
108views Database» more  VLDB 2002»
15 years 6 months ago
Adaptive Index Structures
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
Yufei Tao, Dimitris Papadias
IJKDB
2010
162views more  IJKDB 2010»
15 years 4 months ago
New Trends in Graph Mining: Structural and Node-Colored Network Motifs
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modul...
Francesco Bruno, Luigi Palopoli, Simona E. Rombo
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 10 months ago
Robustness and modular structure in networks
Many complex systems, from power grids and the internet, to the brain and society, can be modeled using modular networks. Modules, densely interconnected groups of elements, often...
James P. Bagrow, Sune Lehmann, Yong-Yeol Ahn
ENTCS
2007
120views more  ENTCS 2007»
15 years 6 months ago
Local Reasoning about Data Update
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to loc...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty