Sciweavers

348 search results - page 54 / 70
» di 2008
Sort
View
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
13 years 7 months ago
Gadgets, Approximation, and Linear Programming
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
SIGKDD
2000
106views more  SIGKDD 2000»
13 years 7 months ago
Data mining for hypertext: A tutorial survey
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a di erence to the e ectiveness of infor...
Soumen Chakrabarti
CN
1998
74views more  CN 1998»
13 years 7 months ago
Generating Advanced Query Interfaces
With the increasing popularity of the World Wide Web, the number of information sources providing access to various types of data has increased considerably. While simple data ret...
Dongwon Lee, Divesh Srivastava, Dimitra Vista
CACM
1999
138views more  CACM 1999»
13 years 7 months ago
Onion Routing
Onion Routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and tra c a...
David M. Goldschlag, Michael G. Reed, Paul F. Syve...
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 7 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri