1162 search results - page 19 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
117
Voted
ACL
2004
15 years 5 months ago
2004
Sentiment analysis seeks to identify the viewpoint(s) underlying a text span; an example application is classifying a movie review as "thumbs up" or "thumbs down&qu...
115
Voted
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
140
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
116
Voted
STOC
1999
ACM
15 years 8 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
96
Voted
JDA
2007
15 years 3 months ago
2007
In this paper, we deal with the maximum integer multiflow and the minimum multicut problems in rectilinear grid graphs with uniform capacities on the edges. The first problem is...