Sciweavers

7930 search results - page 463 / 1586
» Greedy in Approximation Algorithms
Sort
View
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
16 years 7 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 11 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
AUTOMATICA
2006
67views more  AUTOMATICA 2006»
15 years 7 months ago
Numerical methods for controlled regime-switching diffusions and regime-switching jump diffusions
This work is concerned with numerical methods for controlled regime-switching diffusions, and regime-switching jump diffusions. Numerical procedures based on Markov chain approxim...
Q. S. Song, Gang George Yin, Z. Zhang
JC
2000
45views more  JC 2000»
15 years 6 months ago
What Is the Complexity of Stieltjes Integration?
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
Arthur G. Werschulz
ALGOSENSORS
2010
Springer
15 years 5 months ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker