Sciweavers

2272 search results - page 59 / 455
» Capture Complexity by Partition
Sort
View
ASPLOS
2008
ACM
14 years 11 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
ICSE
1999
IEEE-ACM
15 years 2 months ago
Architectural Framework Modeling in Telecommunication Domain
Architectural frameworks have shown to increase the design reusability in large-scale object-oriented systems. Drawing on experience in complex software systems development in tel...
Giulio Fregonese, Alessandro Zorer, Giovanni Corte...
SOFTVIS
2006
ACM
15 years 3 months ago
Multiscale and multivariate visualizations of software evolution
Software evolution visualization is a promising technique for assessing the software development process. We study how complex correlations of software evolution attributes can be...
Lucian Voinea, Alexandru Telea
NIPS
2007
14 years 11 months ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...
ICASSP
2011
IEEE
14 years 1 months ago
A classifier-based decoding approach for large scale distributed coding
Canonical distributed quantization schemes do not scale to large sensor networks due to the exponential decoder storage complexity that they entail. Prior efforts to tackle this i...
Kumar Viswanatha, Sharadh Ramaswamy, Ankur Saxena,...