Sciweavers

243 search results - page 20 / 49
» Drawing Borders Efficiently
Sort
View
SIGMOD
1997
ACM
148views Database» more  SIGMOD 1997»
13 years 12 months ago
Beyond Market Baskets: Generalizing Association Rules to Correlations
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confi...
Sergey Brin, Rajeev Motwani, Craig Silverstein
INFOCOM
1992
IEEE
13 years 11 months ago
An Assessment of State and Lookup Overhead in Routers
The current Internet is based on a stateless (datagram) architecture. However, many recent proposals rely on the maintenance of state information within network routers, leading t...
Deborah Estrin, Danny J. Mitzel
CCS
2006
ACM
13 years 11 months ago
Optimizing BGP security by exploiting path stability
The Border Gateway Protocol (BGP) is the de facto interdomain routing protocol on the Internet. While the serious vulnerabilities of BGP are well known, no security solution has b...
Kevin R. B. Butler, Patrick McDaniel, William Aiel...
VMV
2008
187views Visualization» more  VMV 2008»
13 years 9 months ago
Patch-Graph Reconstruction for Piecewise Smooth Surfaces
In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
Philipp Jenke, Michael Wand, Wolfgang Straße...
JIIS
2010
106views more  JIIS 2010»
13 years 2 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...