Sciweavers

1133 search results - page 190 / 227
» Best Practices in e-Assessment
Sort
View
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 11 days ago
Relationship privacy: output perturbation for queries with joins
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Su...
MOBIHOC
2009
ACM
16 years 11 days ago
Experimental characterization of sectorized antennas in dense 802.11 wireless mesh networks
Sectorized antennas can increase wireless network capacity through greater spatial reuse. Despite their increasing popularity, their real-world performance characteristics in dens...
Anand Prabhu Subramanian, Henrik Lundgren, Theodor...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 7 days ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
RECOMB
2006
Springer
16 years 4 days ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 4 days ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount