Sciweavers

5055 search results - page 427 / 1011
» Relative Timing
Sort
View
CIVR
2003
Springer
107views Image Analysis» more  CIVR 2003»
16 years 24 days ago
Fast Video Retrieval under Sparse Training Data
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
Yan Liu, John R. Kender
TON
2008
125views more  TON 2008»
15 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
EDBT
2006
ACM
194views Database» more  EDBT 2006»
16 years 7 months ago
Hermes - A Framework for Location-Based Data Management
The aim of this paper is to demonstrate Hermes, a robust framework capable of aiding a spatio-temporal database developer in modeling, constructing and querying a database with dyn...
Nikos Pelekis, Yannis Theodoridis, Spyros Vosinaki...
CP
2005
Springer
16 years 1 months ago
Solving Simple Planning Problems with More Inference and No Search
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
Vincent Vidal, Hector Geffner
188
Voted
BXML
2004
15 years 9 months ago
Query Reformulation for the XML standards XPath, XQuery and XSLT
: Whenever transformation of data is used to bridge the gap of different data formats, and a query is given in the destination format, query reformulation can speed up the transfor...
Sven Groppe, Stefan Böttcher