Sciweavers

2370 search results - page 46 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
COLOGNETWENTE
2009
14 years 10 months ago
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
Stavros D. Nikolopoulos, Charis Papadopoulos
KES
2008
Springer
14 years 9 months ago
An Algorithm to Assess the Reliability of Hierarchical Clusters in Gene Expression Data
The validation of clusters discovered in bio-molecular data is a central issue in bioinformatics. Recently, stability-based methods have been successfully applied to the analysis o...
Roberto Avogadri, Matteo Brioschi, Francesca Ruffi...
INFOCOM
2012
IEEE
13 years 5 days ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
ICCV
2011
IEEE
13 years 9 months ago
Data-driven Crowd Analysis in Videos
In this work we present a new crowd analysis algorithm powered by behavior priors that are learned on a large database of crowd videos gathered from the Internet. The algorithm wo...
Mikel Rodriguez, Josef Sivic, Ivan Laptev, Jean-Yv...
TSMC
2010
14 years 4 months ago
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
Giovanni Righini, Emanuele Tresoldi