Sciweavers

1731 search results - page 321 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
HPDC
2009
IEEE
14 years 2 months ago
Resource co-allocation for large-scale distributed environments
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
Claris Castillo, George N. Rouskas, Khaled Harfous...
SIGSOFT
2007
ACM
14 years 8 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
BMCBI
2010
104views more  BMCBI 2010»
13 years 7 months ago
FragViz: visualization of fragmented networks
Background: Researchers in systems biology use network visualization to summarize the results of their analysis. Such networks often include unconnected components, which popular ...
Miha Stajdohar, Minca Mramor, Blaz Zupan, Janez De...
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
14 years 7 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
IMC
2010
ACM
13 years 5 months ago
Primitives for active internet topology mapping: toward high-frequency characterization
Current large-scale topology mapping systems require multiple days to characterize the Internet due to the large amount of probing traffic they incur. The accuracy of maps from ex...
Robert Beverly, Arthur Berger, Geoffrey G. Xie