13306 search results - page 2423 / 2662 » Theoretical Computer Science |
297
click to vote
IWPEC
2010
Springer
15 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
229
click to vote
MOBIHOC
2010
ACM
15 years 5 months ago
2010
ACM
We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP's design is that data traffic c...
229
click to vote
ACL
2009
15 years 5 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
209
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
249
Voted
TCSV
2010
15 years 1 months ago
2010
Abstract--Most existing works on routing for video transmission over multihop wireless networks only focus on how to satisfy the network-oriented quality-of-service (QoS), such as ...