Sciweavers

449 search results - page 55 / 90
» Intention-Disguised Algorithmic Trading
Sort
View
INFOCOM
2002
IEEE
14 years 1 months ago
FPAC: Fast, Fixed-Cost Authentication for Access to Reserved Resources
—Enhanced network services often involve allocating resources (bandwidth/buffer space) preferentially to packets belonging to certain flows or traffic classes. Such services ar...
Kenneth L. Calvert, Srinivasan Venkatraman, Jim Gr...
TIT
1998
80views more  TIT 1998»
13 years 8 months ago
Structural Risk Minimization Over Data-Dependent Hierarchies
The paper introduces some generalizations of Vapnik’s method of structural risk minimisation (SRM). As well as making explicit some of the details on SRM, it provides a result t...
John Shawe-Taylor, Peter L. Bartlett, Robert C. Wi...
INFOCOM
2010
IEEE
13 years 7 months ago
PeopleRank: Social Opportunistic Forwarding
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
Abderrahmen Mtibaa, Martin May, Christophe Diot, M...
IPPS
2010
IEEE
13 years 6 months ago
Exploring parallelism in short sequence mapping using Burrows-Wheeler Transform
Next-generation high throughput sequencing instruments are capable of generating hundreds of millions of reads in a single run. Mapping those reads to a reference genome is an ext...
Doruk Bozdag, Ayat Hatem, Ümit V. Çata...
NAACL
2010
13 years 6 months ago
From Baby Steps to Leapfrog: How "Less is More" in Unsupervised Dependency Parsing
We present three approaches for unsupervised grammar induction that are sensitive to data complexity and apply them to Klein and Manning's Dependency Model with Valence. The ...
Valentin I. Spitkovsky, Hiyan Alshawi, Daniel Jura...