Sciweavers

919 search results - page 101 / 184
» Standard Data Representations for VLSI Algorithm Development
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
NIPS
2003
14 years 11 months ago
Unsupervised Context Sensitive Language Acquisition from a Large Corpus
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
Zach Solan, David Horn, Eytan Ruppin, Shimon Edelm...
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
15 years 4 months ago
A Virtual Prototype for Bluetooth over Ultra Wide Band System Level Design
The industry is merging two different Wireless Personal Area Networks (WPAN) technologies: Bluetooth (BT) and WiMedia Ultra Wide Band (UWB), into a single BT over UWB (BToUWB) spe...
Alexandre Lewicki, Javier del Prado Pavon, Jacky T...
NIPS
2008
14 years 11 months ago
Regularized Co-Clustering with Dual Supervision
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
Vikas Sindhwani, Jianying Hu, Aleksandra Mojsilovi...
ENTCS
2008
85views more  ENTCS 2008»
14 years 10 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset