4536 search results - page 786 / 908 » Contention-Sensitive Data Structures and Algorithms |
114
click to vote
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We develop a semi-supervised learning method that constrains the posterior distribution of latent variables under a generative model to satisfy a rich set of feature expectation c...
128
Voted
COMCOM
2010
15 years 19 days ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
109
Voted
CORR
2010
Springer
15 years 18 days ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
110
Voted
DM
2006
15 years 16 days ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
FMSD
2006
15 years 16 days ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...