Sciweavers

225 search results - page 25 / 45
» Stably Computable Properties of Network Graphs
Sort
View
159
Voted
WOSP
1998
ACM
15 years 5 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
84
Voted
ACCV
2010
Springer
14 years 7 months ago
Linear Solvability in the Viewing Graph
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
Alessandro Rudi, Matia Pizzoli, Fiora Pirri
113
Voted
EJC
2008
15 years 25 days ago
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
Jan Foniok, Jaroslav Nesetril, Claude Tardif
FOCS
2008
IEEE
15 years 7 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
119
Voted
GD
2008
Springer
15 years 1 months ago
Graph Drawing for Security Visualization
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
Roberto Tamassia, Bernardo Palazzi, Charalampos Pa...