Sciweavers

866 search results - page 58 / 174
» On Dynamic Shortest Paths Problems
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford
EMNLP
2007
13 years 9 months ago
Tree Kernel-Based Relation Extraction with Context-Sensitive Structured Parse Tree Information
This paper proposes a tree kernel with contextsensitive structured parse tree information for relation extraction. It resolves two critical problems in previous tree kernels for r...
Guodong Zhou, Min Zhang, Dong-Hong Ji, Qiaoming Zh...
MFCS
2009
Springer
14 years 2 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
CDC
2008
IEEE
159views Control Systems» more  CDC 2008»
14 years 2 months ago
Incorporating drivability metrics into optimal energy management strategies for Hybrid Vehicles
— Hybrid Vehicle fuel economy performance is highly sensitive to the energy management strategy used to select among multiple energy sources. Optimal solutions are easy to specif...
Daniel F. Opila, Deepak Aswani, Ryan McGee, Jeffre...
ICCV
2005
IEEE
14 years 1 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov