Sciweavers

1208 search results - page 154 / 242
» On Counting Generalized Colorings
Sort
View
CCS
2008
ACM
15 years 9 days ago
Privacy-safe network trace sharing via secure queries
Privacy concerns relating to sharing network traces have traditionally been handled via sanitization, which includes removal of sensitive data and IP address anonymization. We arg...
Jelena Mirkovic
DAMON
2008
Springer
15 years 2 days ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
LREC
2008
80views Education» more  LREC 2008»
14 years 11 months ago
Turning a Term Extractor into a new Domain: first Experiences
Computational terminology has notably evolved since the advent of computers. Regarding the extraction of terms in particular, a large number of resources has been developed: from ...
Jorge Vivaldi, Anna Joan, Mercè Lorente
NAACL
2004
14 years 11 months ago
The Web as a Baseline: Evaluating the Performance of Unsupervised Web-based Models for a Range of NLP Tasks
Previous work demonstrated that web counts can be used to approximate bigram frequencies, and thus should be useful for a wide variety of NLP tasks. So far, only two generation ta...
Mirella Lapata, Frank Keller
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
14 years 11 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau