Sciweavers

697 search results - page 18 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
WCRE
2003
IEEE
14 years 26 days ago
Problems Creating Task-relevant Clone Detection Reference Data
One prevalent method for evaluating the results of automated software analysis tools is to compare the tools’ output to the judgment of human experts. This evaluation strategy i...
Andrew Walenstein, Nitin Jyoti, Junwei Li, Yun Yan...
TCC
2005
Springer
95views Cryptology» more  TCC 2005»
14 years 1 months ago
Keyword Search and Oblivious Pseudorandom Functions
We study the problem of privacy-preserving access to a database. Particularly, we consider the problem of privacy-preserving keyword search (KS), where records in the database are ...
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Om...
IPPS
2010
IEEE
13 years 5 months ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
CORR
2011
Springer
268views Education» more  CORR 2011»
12 years 11 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
14 years 15 days ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi