2137 search results - page 258 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
178
Voted
WIA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
148
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
154
click to vote
ICC
2007
IEEE
16 years 19 days ago
2007
IEEE
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
162
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...
170
click to vote
ICALP
2007
Springer
16 years 14 days ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...