Sciweavers

208 search results - page 33 / 42
» Improved upper bounds on the crossing number
Sort
View
CSL
2006
Springer
13 years 11 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba
24
Voted
HPDC
2005
IEEE
14 years 1 months ago
GWiQ-P: an efficient decentralized grid-wide quota enforcement protocol
Mega grids span several continents and may consist of millions of nodes and billions of tasks executing at any point in time. This setup calls for scalable and highly available re...
Kfir Karmon, Liran Liss, Assaf Schuster
ACL
2006
13 years 8 months ago
A Progressive Feature Selection Algorithm for Ultra Large Feature Spaces
Recent developments in statistical modeling of various linguistic phenomena have shown that additional features give consistent performance improvements. Quite often, improvements...
Qi Zhang, Fuliang Weng, Zhe Feng
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 4 months ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 2 months ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro