Sciweavers

13214 search results - page 2392 / 2643
» Pseudorandomness for network algorithms
Sort
View
154
Voted
SIGSOFT
2008
ACM
16 years 7 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
WWW
2009
ACM
16 years 7 months ago
Unsupervised query categorization using automatically-built concept graphs
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...
Eustache Diemert, Gilles Vandelle
WWW
2008
ACM
16 years 7 months ago
Circular context-based semantic matching to identify web service composition
This paper provides initial analysis in identifying possible Web services composition using context-based semantic matching. Context-based semantic matching allows service composi...
Aviv Segev
WWW
2008
ACM
16 years 7 months ago
Measuring extremal dependencies in web graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. ...
Yana Volkovich, Nelly Litvak, Bert Zwart
WWW
2006
ACM
16 years 7 months ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang
« Prev « First page 2392 / 2643 Last » Next »