10996 search results - page 194 / 2200 » Future Directions in Computing |
154
Voted
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
134
Voted
DISOPT
2008
15 years 5 months ago
2008
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
172
click to vote
BMVC
2010
15 years 2 months ago
2010
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
145
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
In GIS and spatial databases, cardinal directions are frequently used as selection and join criteria in query languages. However, most cardinal direction models are only able to h...
137
click to vote
Publication
We propose a method to control the luminance distribution on a scene by modeling the light propagation with direct and indirect components separately. To reduce the measurement tim...