Sciweavers

2842 search results - page 63 / 569
» Expansion and Search in Networks
Sort
View
ICASSP
2011
IEEE
14 years 5 months ago
Hill climbing on speech lattices: A new rescoring framework
We describe a new approach for rescoring speech lattices — with long-span language models or wide-context acoustic models — that does not entail computationally intensive latt...
Ariya Rastrow, Markus Dreyer, Abhinav Sethy, Sanje...
SIGIR
2011
ACM
14 years 4 months ago
Parameterized concept weighting in verbose queries
The majority of the current information retrieval models weight the query concepts (e.g., terms or phrases) in an unsupervised manner, based solely on the collection statistics. I...
Michael Bendersky, Donald Metzler, W. Bruce Croft
128
Voted
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 7 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
114
Voted
WIOPT
2005
IEEE
15 years 7 months ago
Optimal Controlled Flooding Search in a Large Wireless Network
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
Nicholas B. Chang, Mingyan Liu
86
Voted
JSAC
2008
73views more  JSAC 2008»
15 years 1 months ago
Quasi-Dynamic Network Design Considering Different Service Holding Times
Abstract-- We propose a quasi-dynamic network design algorithm considering traffic growth in multi-layered photonic networks that consist of electrical paths and optical paths. The...
Koichi Kanie, Hiroshi Hasegawa, Ken-ichi Sato