Sciweavers

1661 search results - page 200 / 333
» Space-time Interest Points
Sort
View
SCALESPACE
2007
Springer
16 years 14 days ago
A Generic Approach to the Filtering of Matrix Fields with Singular PDEs
Abstract. There is an increasing demand to develop image processing tools for the filtering and analysis of matrix-valued data, so-called matrix fields. In the case of scalar-val...
Bernhard Burgeth, Stephan Didas, Luc Florack, Joac...
WADS
2007
Springer
145views Algorithms» more  WADS 2007»
16 years 14 days ago
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
Jörg Derungs, Riko Jacob, Peter Widmayer
ACSC
2006
IEEE
16 years 12 days ago
CASO: a framework for dealing with objectives in a constraint-based extension to AgentSpeak(L)
Incorporating constraints into a reactive BDI agent programming language can lead to better expressive capabilities as well as more efficient computation (in some instances). More...
Aniruddha Dasgupta, Aditya K. Ghose
AINA
2006
IEEE
16 years 12 days ago
Peer-Tree: A Hybrid Peer-to-Peer Overlay for Service Discovery
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
Jing Tie, Hai Jin, Shengli Li, Xuanhua Shi, Hanhua...
FOCS
2006
IEEE
16 years 12 days ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee