3260 search results - page 184 / 652 » Lightweight linked data |
136
click to vote
NIPS
2004
15 years 3 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
93
Voted
CIKM
2010
Springer
15 years 17 days ago
2010
Springer
We study the problem of anonymizing data with quasi-sensitive attributes. Quasi-sensitive attributes are not sensitive by themselves, but certain values or their combinations may ...
130
Voted
IV
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...
133
Voted
WIOPT
2006
IEEE
15 years 8 months ago
2006
IEEE
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
104
click to vote
IH
2005
Springer
15 years 8 months ago
2005
Springer
This paper puts in consideration the concepts of security and robustness in watermarking, in order to be able to establish a clear frontier between them. A new information-theoreti...