Sciweavers

2842 search results - page 72 / 569
» Expansion and Search in Networks
Sort
View
ARVLSI
1999
IEEE
162views VLSI» more  ARVLSI 1999»
15 years 6 months ago
Conjunction Search Using a 1-D, Analog VLSI-based, Attentional Search/Tracking Chip
The ability of animals to select a limited region of sensory space for scrutiny is an important factor in dealing with cluttered or complex sensory environments. Such an attention...
Timothy K. Horiuchi, Ernst Niebur
IJWIN
2007
68views more  IJWIN 2007»
15 years 1 months ago
Density-Independent, Scalable Search in Ad Hoc Networks
— We analyze the asymptotic cost of discovering a route within a flat ad hoc network and we show that one can discover a route with cost that is proportional only to the area of...
Zygmunt J. Haas, Rimon Barr
109
Voted
ICWN
2004
15 years 3 months ago
Searching in Variably Connected P2P Networks
Peer-to-Peer networks are gaining popularity through file-sharing communities. Most P2P networks demand a certain stability from it's nodes in order to function satisfactory. ...
Njål T. Borch, Lars Kristian Vognild
EWCBR
2008
Springer
15 years 3 months ago
Provenance, Trust, and Sharing in Peer-to-Peer Case-Based Web Search
Despite the success of modern Web search engines, challenges remain when it comes to providing people with access to the right information at the right time. In this paper, we desc...
Peter Briggs, Barry Smyth
ICASSP
2011
IEEE
14 years 5 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney