Sciweavers

1857 search results - page 218 / 372
» Minimum Degree Orderings
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
16 years 6 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
FOCS
2009
IEEE
16 years 1 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
BROADNETS
2007
IEEE
16 years 26 days ago
On supporting high quality 3D geometry multicasting over IEEE 802.11 wireless networks
—With significant improvements in both wireless technologies and computational capabilities of mobile devices, it is now possible to exchange and render 3D graphics over wireless...
Hui Li, Ming Li, B. Prabhakaran
ICCCN
2007
IEEE
16 years 25 days ago
Node-Replacement Policies to Maintain Threshold-Coverage in Wireless Sensor Networks
Abstract— With the rapid deployment of wireless sensor networks, there are several new sensing applications with specific requirements. Specifically, target tracking applicatio...
Sachin Parikh, Vinod Vokkarane, Liudong Xing, Daya...