Sciweavers

2104 search results - page 28 / 421
» Sorting with networks of data structures
Sort
View
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
13 years 8 months ago
Intersection in Integer Inverted Indices
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
Peter Sanders, Frederik Transier
BMCBI
2006
195views more  BMCBI 2006»
13 years 7 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
IFIP
2010
Springer
13 years 11 months ago
Processing of Flow Accounting Data in Java: Framework Design and Performance Evaluation
Abstract Flow Accounting is a passive monitoring mechanism implemented in routers that gives insight into trac behavior and network characteristics. However, processing of Flow Ac...
Jochen Kögel, Sebastian Scholz
ISCC
2009
IEEE
262views Communications» more  ISCC 2009»
14 years 2 months ago
Babelchord: a social tower of DHT-based overlay networks
Chord is a protocol to distribute and retrieve information at large scale. It builds a large but rigid overlay network without taking into account the social nature and the underl...
Luigi Liquori, Cédric Tedeschi, Francesco B...
ICSE
2000
IEEE-ACM
13 years 11 months ago
Software engineering for mobility: a roadmap
The term distributed computing conjures the image of a fixed network structure whose nodes support the execution of processes that communicate with each other via messages traveli...
Gruia-Catalin Roman, Gian Pietro Picco, Amy L. Mur...