Sciweavers

599 search results - page 76 / 120
» The repeater tree construction problem
Sort
View
ENTCS
2006
144views more  ENTCS 2006»
14 years 9 months ago
Infinitary Howe's Method
Howe's method is a well-known technique for proving that various kinds of applicative bisimilarity (or similarity) on a functional language are congruences (or precongruences...
Paul Blain Levy
JCO
2006
126views more  JCO 2006»
14 years 9 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...
IASTEDSEA
2004
14 years 11 months ago
Higher-order strategic programming: A road to software assurance
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
Victor L. Winter, Steve Roach, Fares Fraij
CACM
1998
110views more  CACM 1998»
14 years 9 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
PAKDD
2007
ACM
110views Data Mining» more  PAKDD 2007»
15 years 3 months ago
Combining Convolution Kernels Defined on Heterogeneous Sub-structures
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...
Minlie Huang, Xiaoyan Zhu