Sciweavers

1403 search results - page 82 / 281
» Set cover algorithms for very large datasets
Sort
View
WWW
2010
ACM
15 years 1 months ago
Hierarchical cluster visualization in web mapping systems
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
Jean-Yves Delort
KDD
1999
ACM
220views Data Mining» more  KDD 1999»
15 years 2 months ago
Efficient Mining of Emerging Patterns: Discovering Trends and Differences
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
Guozhu Dong, Jinyan Li
CG
2010
Springer
14 years 7 months ago
A Principled Method for Exploiting Opening Books
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez,...
INFOCOM
2007
IEEE
15 years 4 months ago
Load Balancing in Large-Scale RFID Systems
A radio frequency identifier (RFID) system consists of inexpensive, uniquely identifiable tags that are mounted on physical objects, and readers that track these tags (and hence...
Qunfeng Dong, Ashutosh Shukla, Vivek Shrivastava, ...
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
15 years 10 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...