Sciweavers

359 search results - page 71 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
PAMI
2012
11 years 7 months ago
Exploring Context and Content Links in Social Media: A Latent Space Method
—Social media networks contain both content and context-specific information. Most existing methods work with either of the two for the purpose of multimedia mining and retrieva...
Guo-Jun Qi, Charu C. Aggarwal, Qi Tian, Heng Ji, T...
TSP
2008
151views more  TSP 2008»
13 years 5 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
DAC
2003
ACM
14 years 6 months ago
On-chip logic minimization
While Boolean logic minimization is typically used in logic synthesis, logic minimization can be useful in numerous other applications. However, many of those applications, such a...
Roman L. Lysecky, Frank Vahid
MOBISYS
2007
ACM
14 years 5 months ago
Improving mobile database access over wide-area networks without degrading consistency
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is acc...
Niraj Tolia, Mahadev Satyanarayanan, Adam Wolbach