Sciweavers

1991 search results - page 65 / 399
» Small Models of Large Machines
Sort
View
JUCS
2010
108views more  JUCS 2010»
14 years 4 months ago
Extending the Methods for Computing the Importance of Entity Types in Large Conceptual Schemas
: Visualizing and understanding large conceptual schemas requires the use of specific methods. These methods generate clustered, summarized, or focused schemas that are easier to v...
Antonio Villegas, Antoni Olivé
VC
2010
143views more  VC 2010»
14 years 4 months ago
A PDE method for patchwise approximation of large polygon meshes
Abstract Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (C...
Yun Sheng, Alexei Sourin, Gabriela González...
BMCBI
2010
140views more  BMCBI 2010»
14 years 7 months ago
An improved machine learning protocol for the identification of correct Sequest search results
Background: Mass spectrometry has become a standard method by which the proteomic profile of cell or tissue samples is characterized. To fully take advantage of tandem mass spectr...
Morten Kallberg, Hui Lu
MASCOTS
2010
14 years 11 months ago
Predicting the Performance of Virtual Machine Migration
With the ability to move virtual machines between physical hosts, live migration is a core feature of virtualisation. However for migration to be useful, deployable feature on a la...
Sherif Akoush, Ripduman Sohan, Andrew Rice, Andrew...
SPIRE
2010
Springer
14 years 8 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie