Sciweavers

4560 search results - page 755 / 912
» Finding Data in the Neighborhood
Sort
View
FMSD
2006
140views more  FMSD 2006»
13 years 9 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
GIS
2006
ACM
13 years 9 months ago
Efficient integration of road maps
Integration of two road maps is finding a matching between pairs of objects that represent, in the maps, the same realworld road. Several algorithms were proposed in the past for ...
Eliyahu Safra, Yaron Kanza, Yehoshua Sagiv, Yerach...
CII
2007
88views more  CII 2007»
13 years 9 months ago
Benefits of an item-centric enterprise-data model in logistics services: A case study
The paper uses a case example to present a novel way of building enterprise information systems. The objective is to bring forth the benefits of an item centric systems design in ...
Mikko Rönkkö, Mikko Kärkkäinen...
IR
2008
13 years 9 months ago
Features for image retrieval: an experimental comparison
An experimental comparison of a large number of different image descriptors for content-based image retrieval is presented. Many of the papers describing new techniques and descri...
Thomas Deselaers, Daniel Keysers, Hermann Ney
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 9 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri