Sciweavers

452 search results - page 50 / 91
» date 2010
Sort
View
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
16 years 1 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
ICASSP
2010
IEEE
15 years 2 months ago
Bayesian compressive sensing for phonetic classification
In this paper, we introduce a novel bayesian compressive sensing (CS) technique for phonetic classification. CS is often used to characterize a signal from a few support training...
Tara N. Sainath, Avishy Carmi, Dimitri Kanevsky, B...
WWW
2010
ACM
15 years 11 months ago
A scalable machine-learning approach for semi-structured named entity recognition
Named entity recognition studies the problem of locating and classifying parts of free text into a set of predefined categories. Although extensive research has focused on the de...
Utku Irmak, Reiner Kraft
JCT
2010
63views more  JCT 2010»
15 years 2 months ago
Cyclic sieving, promotion, and representation theory
We prove a collection of conjectures of D. White [37], as well as some related conjectures of Abuzzahab-Korson-Li-Meyer [1] and of Reiner and White [21], [37], regarding the cyclic...
Brendon Rhoades
PET
2010
Springer
15 years 8 months ago
Anonymous Webs of Trust
Abstract. Webs of trust constitute a decentralized infrastructure for establishing the authenticity of the binding between public keys and users and, more generally, trust relation...
Michael Backes, Stefan Lorenz, Matteo Maffei, Kim ...