Sciweavers

69 search results - page 10 / 14
» ejc 2008
Sort
View
99
Voted
EJC
2008
15 years 2 months ago
An Efficient Method for Quick Construction of Web Services
With the development of the Internet, Web services, such as Google Maps API and YouTube Data API, become more important and convenient for the Web knowledge distribution and integr...
Hao Han, Yohei Kotake, Takehiro Tokuda
108
Voted
EJC
2008
15 years 23 days ago
Embeddability of arrangements of pseudocircles into the sphere
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure ...
Ronald Ortner
114
Voted
EJC
2008
15 years 23 days ago
Pattern classes of permutations via bijections between linearly ordered sets
Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
Sophie Huczynska, Nikola Ruskuc
EJC
2008
15 years 23 days ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
100
Voted
EJC
2008
15 years 23 days ago
On Postnikov's hook length formula for binary trees
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
William Y. C. Chen, Laura L. M. Yang