Sciweavers

2695 search results - page 441 / 539
» Learning Graph Matching
Sort
View
JCO
2006
126views more  JCO 2006»
15 years 2 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
JSW
2008
167views more  JSW 2008»
15 years 2 months ago
An Approach to Discover Dependencies between Service Operations
Service composition is emerging as an important paradigm for constructing distributed applications by combining and reusing independently developed component services. One key issu...
Shuying Yan, Jing Wang 0002, Chen Liu, Lei Liu
108
Voted
JWSR
2007
106views more  JWSR 2007»
15 years 2 months ago
Architecture-Driven Service Discovery for Service Centric Systems
: Service discovery has been recognised as an important aspect in the development of service centric systems, i.e., software systems which deploy web services. To develop such syst...
Alexander Kozlenkov, George Spanoudakis, Andrea Zi...
109
Voted
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
15 years 2 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg
IM
2007
15 years 2 months ago
PageRank of Scale-Free Growing Networks
PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of Web page visits by a random surfer and thus it r...
Konstantin Avrachenkov, Dmitri Lebedev