Sciweavers

2778 search results - page 146 / 556
» Limit complexities revisited
Sort
View
JAT
2010
39views more  JAT 2010»
15 years 4 months ago
On spectral polynomials of the Heun equation. I
The classical Heun equation has the form  Q(z) d2 dz2 + P (z) d dz + V (z) ff S(z) = 0, where Q(z) is a cubic complex polynomial, P (z) is a polynomial of degree at most 2 and ...
Boris Shapiro, Milos Tater
SIVP
2010
118views more  SIVP 2010»
15 years 4 months ago
Self-organization of sensor networks for detection of pervasive faults
Resource aware operation of sensor networks requires adaptive re-organization to dynamically adapt to the operational environment. A complex dynamical system of interacting compone...
Abhishek Srivastav, Asok Ray
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
15 years 4 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»
15 years 4 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...
CORR
2010
Springer
39views Education» more  CORR 2010»
15 years 3 months ago
Non-redundant random generation from weighted context-free languages
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
Yann Ponty