Sciweavers

3267 search results - page 295 / 654
» Generalized quasirandom graphs
Sort
View
SIAMDM
2010
117views more  SIAMDM 2010»
15 years 5 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
WIOPT
2010
IEEE
15 years 5 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
IFIPTCS
2010
15 years 4 months ago
A Logic on Subobjects and Recognizability
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
Harrie Jan Sander Bruggink, Barbara König
EICS
2011
ACM
14 years 10 months ago
A model-based approach for distributed user interfaces
This paper describes a model-based approach for designing distributed user interfaces (DUIs), i.e. graphical user interfaces that are distributed along one or many of the followin...
Jérémie Melchior, Jean Vanderdonckt,...
SAC
2011
ACM
14 years 9 months ago
ImageAlert: credibility analysis of text-image pairs on the web
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
Yusuke Yamamoto, Katsumi Tanaka