7930 search results - page 495 / 1586 » Greedy in Approximation Algorithms |
200
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
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...
211
click to vote
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
193
click to vote
INFOCOM
2003
IEEE
16 years 7 days ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
177
click to vote
COLCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Recently, overlay network-based collaborative applications such as instant messaging, content sharing, and Internet telephony are becoming increasingly popular. Many of these appli...
193
click to vote
INFOCOM
2003
IEEE
16 years 7 days ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...