Sciweavers

3708 search results - page 339 / 742
» Approximating Betweenness Centrality
Sort
View
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 10 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 10 months ago
High-Performance and Scalability through Application Tier,In-Memory Data Management
TimesTen Performance Software's Front-Tier product is an application-tier data cache that inter-operates with disk-based relational database management systems (RDBMSs) to ac...
KDD
1995
ACM
108views Data Mining» more  KDD 1995»
15 years 10 months ago
A Statistical Perspective On Knowledge Discovery In Databases
The quest to nd models usefully characterizing data is a process central to the scienti c method, and has been carried out on many fronts. Researchers from an expanding number of ...
John F. Elder IV, Daryl Pregibon
VLDB
1991
ACM
196views Database» more  VLDB 1991»
15 years 10 months ago
Kaleidoscope Data Model for An English-like Query Language
Most database interfaces provide poor guidance on ad hoc query formulation, burdening users to learn, and to recall precisely the query language and the database. Kaleidoscope avo...
Sang Kyun Cha, Gio Wiederhold
USENIX
2007
15 years 9 months ago
Wresting Control from BGP: Scalable Fine-Grained Route Control
Today’s Internet users and applications are placing increased demands on Internet service providers (ISPs) to deliver fine-grained, flexible route control. To assist network o...
Patrick Verkaik, Dan Pei, Tom Scholl, Aman Shaikh,...