Sciweavers

478 search results - page 95 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
14 years 6 months ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Benyah Shaparenko, Thorsten Joachims
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
14 years 20 days ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
INFOCOM
2006
IEEE
14 years 11 days ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 6 months ago
Exact two-terminal reliability of some directed networks
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
Christian Tanguy