Sciweavers

1391 search results - page 93 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
ICMCS
2009
IEEE
136views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Single-iteration full-search fractional motion estimation for quad full HD H.264/AVC encoding
Fractional motion estimation (FME) is widely used in video compression standards. In H.264/AVC, the precision of motion vector is down to quarter pixels to improve the coding effi...
Pei-Kuei Tsung, Wei-Yin Chen, Li-Fu Ding, Chuan-Yu...
ICCV
2003
IEEE
14 years 9 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
COMPLEX
2009
Springer
14 years 2 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang
ARCS
2005
Springer
14 years 1 months ago
Towards Autonomic Networking Using Overlay Routing Techniques
With an ever-growing number of computers being embedded into our surroundings, the era of ubiquitous computing is approaching fast. However, as the number of networked devices incr...
Kendy Kutzner, Curt Cramer, Thomas Fuhrmann