Sciweavers

1891 search results - page 10 / 379
» Very Large Databases: How Large, How Different
Sort
View
WWW
2009
ACM
15 years 10 months ago
Mining cultural differences from a large number of geotagged photos
We propose a novel method to detect cultural differences over the world automatically by using a large amount of geotagged images on the photo sharing Web sites such as Flickr. W...
Keiji Yanai, Bingyu Qiu
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
16 years 3 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 3 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 5 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
KES
2006
Springer
15 years 3 months ago
Integrated Document Browsing and Data Acquisition for Building Large Ontologies
Named entities (e.g., "Kofi Annan", "Coca-Cola", "Second World War") are ubiquitous in web pages and other types of document and often provide a simpl...
Felix Weigel, Klaus U. Schulz, Levin Brunner, Edua...