Sciweavers

4536 search results - page 786 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICML
2010
IEEE
13 years 11 months ago
High-Performance Semi-Supervised Learning using Discriminatively Constrained Generative Models
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...
Gregory Druck, Andrew McCallum
COMCOM
2010
276views more  COMCOM 2010»
13 years 10 months ago
Adjustable convergecast tree protocol for wireless sensor networks
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...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 10 months ago
Fast Overlapping Group Lasso
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...
Jun Liu, Jieping Ye
DM
2006
87views more  DM 2006»
13 years 10 months ago
A vertex incremental approach for maintaining chordality
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...
Anne Berry, Pinar Heggernes, Yngve Villanger
FMSD
2006
140views more  FMSD 2006»
13 years 10 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
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...
Víctor A. Braberman, Alfredo Olivero, Ferna...