Sciweavers

2778 search results - page 437 / 556
» Limit complexities revisited
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Profile-guided program simplification for effective testing and analysis
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
Lingxiao Jiang, Zhendong Su
ICDT
2009
ACM
128views Database» more  ICDT 2009»
16 years 7 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
WWW
2009
ACM
16 years 7 months ago
Anycast-aware transport for content delivery networks
Anycast-based content delivery networks (CDNs) have many properties that make them ideal for the large scale distribution of content on the Internet. However, because routing chan...
Zakaria Al-Qudah, Seungjoon Lee, Michael Rabinovic...
WWW
2009
ACM
16 years 7 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
WWW
2008
ACM
16 years 7 months ago
Restful web services vs. "big"' web services: making the right architectural decision
Recent technology trends in the Web Services (WS) domain indicate that a solution eliminating the presumed complexity of the WS-* standards may be in sight: advocates of REpresent...
Cesare Pautasso, Olaf Zimmermann, Frank Leymann