Sciweavers

8413 search results - page 1193 / 1683
» Ordering Problem Subgoals
Sort
View
WWW
2008
ACM
16 years 7 months ago
Composite process oriented service discovery in preserving business and timed relation
This paper proposes an approach for solving the problem of composite process oriented service discovery with preserving business and timed relation. Key to our approach is the def...
Yu Dai, Lei Yang, Bin Zhang, Kening Gao
WWW
2008
ACM
16 years 7 months ago
Efficient similarity joins for near duplicate detection
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Jeffrey Xu ...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
Numerical linear algebra in the streaming model
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
Kenneth L. Clarkson, David P. Woodruff
CICLING
2009
Springer
16 years 7 months ago
Improved Unsupervised Name Discrimination with Very Wide Bigrams and Automatic Cluster Stopping
We cast name discrimination as a problem in clustering short contexts. Each occurrence of an ambiguous name is treated independently, and represented using second?order context vec...
Ted Pedersen
SPAA
2009
ACM
16 years 7 months ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...
« Prev « First page 1193 / 1683 Last » Next »