Sciweavers

1002 search results - page 106 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
128
Voted
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
15 years 9 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
LSSC
2007
Springer
15 years 8 months ago
Optimization Based Stabilization of Nonlinear Control Systems
We present a general framework for analysis and design of optimization based numerical feedback stabilization schemes utilizing ideas from relaxed dynamic programming. The applicat...
Lars Grüne
131
Voted
ISBRA
2009
Springer
15 years 9 months ago
Querying Protein-Protein Interaction Networks
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
Guillaume Blin, Florian Sikora, Stéphane Vi...
141
Voted
ECBS
2006
IEEE
166views Hardware» more  ECBS 2006»
15 years 8 months ago
Model Transformations in the Model-Based Development of Real-time Systems
In this paper we argue for UML-based metamodeling and pattern-based graph transformation techniques in computer-based systems development through an illustrative example from the ...
Tivadar Szemethy, Gabor Karsai, Daniel Balasubrama...
126
Voted
WWW
2007
ACM
16 years 3 months ago
Towards efficient dominant relationship exploration of the product items on the web
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
Zhenglu Yang, Lin Li, Botao Wang, Masaru Kitsurega...