Sciweavers

280 search results - page 31 / 56
» Using Determining Sets to Distinguish Kneser Graphs
Sort
View
HIS
2003
15 years 1 months ago
Data Mining of Web Access Logs From an Academic Web Site
We have used a general purpose data mining tool to determine whether we can find any ‘golden nuggets’ in the web access logs of a large academic web site. Our goal was to use...
Victor Ciesielski, A. Lalani
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 2 days ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 3 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
VLSID
2008
IEEE
122views VLSI» more  VLSID 2008»
16 years 4 days ago
A Module Checking Based Converter Synthesis Approach for SoCs
Protocol conversion involves the use of a converter to control communication between two or more protocols such that desired system-level specifications can be satisfied. We invest...
Roopak Sinha, Partha S. Roop, Samik Basu
ICSE
2000
IEEE-ACM
15 years 3 months ago
Light-weight context recovery for efficient and accurate program analyses
To compute accurate information efficiently for programs that use pointer variables, a program analysis must account for the fact that a procedure may access different sets of mem...
Donglin Liang, Mary Jean Harrold