Sciweavers

820 search results - page 123 / 164
» Inducing Temporal Graphs
Sort
View
CGF
1999
125views more  CGF 1999»
13 years 8 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
WSDM
2012
ACM
245views Data Mining» more  WSDM 2012»
12 years 4 months ago
The early bird gets the buzz: detecting anomalies and emerging trends in information networks
In this work we propose a novel approach to anomaly detection in streaming communication data. We first build a stochastic model for the system based on temporal communication pa...
Brian Thompson
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 3 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
AIRWEB
2009
Springer
14 years 3 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
IWPEC
2009
Springer
14 years 3 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...