Sciweavers

2498 search results - page 358 / 500
» Data Structures with Unpredictable Timing
Sort
View
167
Voted
TGC
2010
Springer
15 years 2 months ago
CarPal: Interconnecting Overlay Networks for a Community-Driven Shared Mobility
Car sharing and car pooling have proven to be an effective solution to reduce the amount of running vehicles by increasing the number of passengers per car amongst medium/big commu...
Vincenzo Dezani-Ciancaglini, Luigi Liquori, Lauren...
JMLR
2010
134views more  JMLR 2010»
14 years 12 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
TPDS
2010
126views more  TPDS 2010»
14 years 11 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
179
Voted
ICDAR
2011
IEEE
14 years 4 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
CVPR
2012
IEEE
13 years 7 months ago
The inverted multi-index
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
Artem Babenko, Victor S. Lempitsky