1404 search results - page 191 / 281 » Optimization problems in multiple-interval graphs |
157
click to vote
AAIM
2009
Springer
16 years 27 days ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
186
click to vote
FOCS
2008
IEEE
16 years 22 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
152
click to vote
DATE
2007
IEEE
16 years 19 days ago
2007
IEEE
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
133
click to vote
ICALP
2007
Springer
16 years 13 days ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
136
click to vote
DIAL
2006
IEEE
16 years 10 days ago
2006
IEEE
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...