4212 search results - page 642 / 843 » On Compressible Pairings and Their Computation |
191
click to vote
SEMCO
2007
IEEE
16 years 27 days ago
2007
IEEE
Recognizing textual entailment (TE) is a complex task involving knowledge from many different sources. One major source of information in this task is event factuality, since the ...
182
click to vote
ICCTA
2007
IEEE
16 years 25 days ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
157
click to vote
ACCV
2007
Springer
16 years 24 days ago
2007
Springer
A movie captured by a wearable camera affixed to an actor’s body gives audiences the sense of “immerse in the movie”. The raw movie captured by wearable camera needs stabiliz...
165
click to vote
GD
2007
Springer
16 years 23 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
168
click to vote
SOFSEM
2007
Springer
16 years 22 days ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...