1101 search results - page 119 / 221 » An Algorithm for the Graph Crossing Number Problem |
132
click to vote
COCOON
2003
Springer
15 years 10 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
168
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
148
click to vote
DGCI
2009
Springer
15 years 8 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
185
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
169
click to vote
CORR
2012
Springer
14 years 21 days ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...