Sciweavers

10055 search results - page 110 / 2011
» Structured programming using processes
Sort
View
VISSYM
2004
13 years 9 months ago
Software Landscapes: Visualizing the Structure of Large Software Systems
Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and comple...
Michael Balzer, Andreas Noack, Oliver Deussen, Cla...
IPPS
2009
IEEE
14 years 2 months ago
High-throughput protein structure determination using grid computing
Determining the X-ray crystallographic structures of proteins using the technique of molecular replacement (MR) can be a time and labor-intensive trial-and-error process, involvin...
Jason W. Schmidberger, Blair Bethwaite, Colin Enti...
ICIP
2005
IEEE
14 years 1 months ago
Object representation using colour, shape and structure criteria in a binary partition tree
Binary Partition Trees (BPTs) are a well known technique used for region-based image representation and analysis. BPTs are usually created as a result of a merging process based o...
Christian Ferran Bennström, Josep R. Casas
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 9 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
13 years 6 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani