Sciweavers

4137 search results - page 508 / 828
» On the number of matchings of a tree
Sort
View
NIPS
2008
15 years 8 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
FLAIRS
2006
15 years 8 months ago
Melody Track Identification in Music Symbolic Files
Standard MIDI files contain data that can be considered as a symbolic representation of music (a digital score), and most of them are structured as a number of tracks, one of them...
David Rizo, Pedro J. Ponce de León, Antonio...
FUIN
2008
80views more  FUIN 2008»
15 years 6 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...
CORR
2007
Springer
77views Education» more  CORR 2007»
15 years 6 months ago
Quantization Bounds on Grassmann Manifolds of Arbitrary Dimensions and MIMO Communications with Feedback
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
Wei Dai, Youjian Liu, Brian Rider
JCO
2006
126views more  JCO 2006»
15 years 6 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...