15033 search results - page 328 / 3007 » Complexity Theory and Algorithms |
162
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
332
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
193
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
194
click to vote
AOSD
2010
ACM
16 years 1 months ago
2010
ACM
Over the last five years, several systems have been proposed to take distribution into account in Aspect-Oriented Programming. While they appeared to be fruitful to develop or im...
172
click to vote
SIGCOMM
2003
ACM
15 years 11 months ago
2003
ACM
Path vector protocols are currently in the limelight, mainly because the inter-domain routing protocol of the Internet, BGP (Border Gateway Protocol), belongs to this class. In th...