Sciweavers

666 search results - page 104 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
ICDT
2007
ACM
141views Database» more  ICDT 2007»
14 years 3 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 6 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
IEEESCC
2009
IEEE
13 years 6 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
INFOCOM
2010
IEEE
13 years 7 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...
COMCOM
2006
121views more  COMCOM 2006»
13 years 9 months ago
Load-balanced agent activation for value-added network services
In relation to its growth in size and user population, the Internet faces new challenges that have triggered the proposals of value-added network services, e.g., IP multicast, IP ...
Chao Gong, Kamil Saraç, Ovidiu Daescu, Bala...