Sciweavers

3994 search results - page 765 / 799
» Supporting the design of network-spanning applications
Sort
View
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
15 years 10 months ago
Email data cleaning
Addressed in this paper is the issue of `email data cleaning' for text mining. Many text mining applications need take emails as input. Email data is usually noisy and thus i...
Jie Tang, Hang Li, Yunbo Cao, ZhaoHui Tang
80
Voted
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
15 years 9 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
76
Voted
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
15 years 9 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 9 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
SIGMOD
2008
ACM
190views Database» more  SIGMOD 2008»
15 years 9 months ago
XRPC: distributed XQuery and update processing with heterogeneous XQuery engines
We demonstrate XRPC, a minimal XQuery extension that enables distributed querying between heterogeneous XQuery engines. The XRPC language extension enhances the existing concept o...
Ying Zhang, Peter A. Boncz