Sciweavers

2498 search results - page 357 / 500
» Data Structures with Unpredictable Timing
Sort
View
143
Voted
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
15 years 6 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
FMSD
2006
85views more  FMSD 2006»
15 years 5 months ago
Distributed disk-based algorithms for model checking very large Markov chains
In this paper we present data structures and distributed algorithms for CSL model checking-based performance and dependability evaluation. We show that all the necessary computatio...
Alexander Bell, Boudewijn R. Haverkort
CCR
2004
153views more  CCR 2004»
15 years 5 months ago
Tree bitmap: hardware/software IP lookups with incremental updates
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
Will Eatherton, George Varghese, Zubin Dittia
COGSCI
2002
60views more  COGSCI 2002»
15 years 4 months ago
Memory for goals: an activation-based model
Goal-directed cognition is often discussed in terms of specialized memory structures like the "goal stack." The goal-activation model presented here analyzes goal-direct...
Erik M. Altmann, J. Gregory Trafton
SEMWEB
2010
Springer
15 years 3 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood