Sciweavers

4850 search results - page 450 / 970
» Approximate Data Structures with Applications
Sort
View
SIGSOFT
2007
ACM
16 years 8 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
WWW
2008
ACM
16 years 8 months ago
Extracting XML schema from multiple implicit xml documents based on inductive reasoning
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
Masaya Eki, Tadachika Ozono, Toramatsu Shintani
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
15 years 11 months ago
Multi-label learning by exploiting label dependency
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...
Min-Ling Zhang, Kun Zhang
AAAI
1998
15 years 9 months ago
Evolvable Hardware Chip for High Precision Printer Image Compression
This paper describes a data compression chip for the high-precision electrophotographic printer using Evolvable Hardware (EHW). EHW is a new hardware paradigm which combines Genet...
Hidenori Sakanashi, Mehrdad Salami, Masaya Iwata, ...
CVPR
2004
IEEE
16 years 9 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade