330 search results - page 22 / 66 » Random Indexing Revisited |
118
Voted
PVLDB
2010
14 years 10 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
ICDE
2010
IEEE
15 years 7 months ago
2010
IEEE
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
122
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
97
Voted
DCC
2008
IEEE
15 years 12 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
ICIP
1995
IEEE
16 years 1 months ago
1995
IEEE
In recent work, we have shown that morphological openings and closings can be viewed as consistent MAP estimators of morphologically smooth binary image signals immersed in i.i.d....