Sciweavers

2004 search results - page 226 / 401
» Sampling from large graphs
Sort
View
145
Voted
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 9 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
130
Voted
LATIN
2004
Springer
15 years 9 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
FUIN
2000
109views more  FUIN 2000»
15 years 3 months ago
Building Knowledge Scouts Using KGL Metalanguage
Knowledge scouts are software agents that autonomously search for and synthesize user-oriented knowledge (target knowledge) in large local or distributed databases. A knowledge ge...
Ryszard S. Michalski, Kenneth A. Kaufman
CVPR
2005
IEEE
16 years 5 months ago
Computer Vision for Music Identification
We describe how certain tasks in the audio domain can be effectively addressed using computer vision approaches. This paper focuses on the problem of music identification, where t...
Yan Ke, Derek Hoiem, Rahul Sukthankar
ICCV
2005
IEEE
16 years 5 months ago
Deformation Invariant Image Matching
We propose a novel framework to build descriptors of local intensity that are invariant to general deformations. In this framework, an image is embedded as a 2D surface in 3D spac...
Haibin Ling, David W. Jacobs