Sciweavers

2512 search results - page 224 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
153
Voted
BMCBI
2008
123views more  BMCBI 2008»
15 years 4 months ago
PocketMatch: A new algorithm to compare binding sites in protein structures
Background: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various...
Kalidas Yeturu, Nagasuma Chandra
252
Voted
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
16 years 5 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
DSOM
1999
Springer
15 years 8 months ago
Derivation of Backup Service Management Applications from Service and System Models
The backup of large data sets is preferably performed automatically outside of regular working hours. In highly structured computer networks, however, faults and exceptions may rel...
Ingo Lück, Marcus Schönbach, Arnulf Mest...
USENIX
2008
15 years 6 months ago
A Dollar from 15 Cents: Cross-Platform Management for Internet Services
As Internet services become ubiquitous, the selection and management of diverse server platforms now affects the bottom line of almost every firm in every industry. Ideally, such ...
Christopher Stewart, Terence Kelly, Alex Zhang, Ka...
DELFI
2006
15 years 6 months ago
Mobile Learning is Coming of Age - What we have and what we still miss
: Mobile learning has left the status of a new born child. It is time now to implement some structure into the complex and various activities by a framework presented in this paper...
Dirk Frohberg