Sciweavers

373 search results - page 49 / 75
» Identifying graphs from noisy and incomplete data
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 8 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 months ago
Spying Out Accurate User Preferences for Search Engine Adaptation
Abstract. Most existing search engines employ static ranking algorithms that do not adapt to the specific needs of users. Recently, some researchers have studied the use of clickth...
Lin Deng, Wilfred Ng, Xiaoyong Chai, Dik Lun Lee
WWW
2008
ACM
14 years 8 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
3DPVT
2004
IEEE
181views Visualization» more  3DPVT 2004»
13 years 11 months ago
Segmenting Correlation Stereo Range Images using Surface Elements
This paper describes methods for segmenting planar surfaces from noisy 3D data obtained from correlation stereo vision. We make use of local planar surface elements called patchle...
Don Murray, James J. Little
ICCV
2007
IEEE
14 years 1 months ago
Contextual Distance for Data Perception
Structural perception of data plays a fundamental role in pattern analysis and machine learning. In this paper, we develop a new structural perception of data based on local conte...
Deli Zhao, Zhouchen Lin, Xiaoou Tang