150 search results - page 30 / 30 » Compressive Sensing over Graphs |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
CVPR
2009
IEEE
15 years 12 days ago
2009
IEEE
Much research effort on Automatic Image Annotation
(AIA) has been focused on Generative Model, due to its
well formed theory and competitive performance as compared
with many we...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
BROADNETS
2006
IEEE
13 years 9 months ago
2006
IEEE
Sensor webs are heterogeneous collections of sensor devices that collect information and interact with the environment. They consist of wireless sensor networks that are ensembles ...