Sciweavers

4560 search results - page 818 / 912
» Finding Data in the Neighborhood
Sort
View
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 6 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 4 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
CHI
2010
ACM
14 years 4 months ago
Pensieve: supporting everyday reminiscence
Reminiscing is a valuable activity that people of all ages spontaneously and informally partake in as part of their everyday lives. This paper discusses the design and use of Pens...
S. Tejaswi Peesapati, Victoria Schwanda, Johnathon...
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 4 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
WSDM
2009
ACM
178views Data Mining» more  WSDM 2009»
14 years 4 months ago
User Browsing Graph: Structure, Evolution and Application
This paper focuses on ‘user browsing graph’ which is constructed with users’ click-through behavior modeled with Web access logs. User browsing graph has recently been adopt...
Yiqun Liu, Min Zhang, Shaoping Ma, Liyun Ru