Sciweavers

744 search results - page 65 / 149
» Weight Multiplicities for so5(C)
Sort
View
COCOA
2008
Springer
15 years 8 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Peter Damaschke
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
16 years 8 days ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
ICC
2007
IEEE
104views Communications» more  ICC 2007»
16 years 15 days ago
Joint Design of Tx-Rx Beamformers in MIMO Downlink Channel
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
Marian Codreanu, Antti Tölli, Markku J. Juntt...
CLEF
2005
Springer
15 years 11 months ago
Pitt at CLEF05: Data Fusion for Spoken Document Retrieval
Abstract. This paper describes an investigation of data fusion techniques for spoken document retrieval. The effectiveness of retrievals solely based on the outputs from automatic...
Daqing He, Jae-wook Ahn
JMM2
2006
146views more  JMM2 2006»
15 years 6 months ago
Probabilistic Algorithms, Integration, and Empirical Evaluation for Disambiguating Multiple Selections in Frustum-Based Pointing
There are a few fundamental pointing-based user interface techniques for performing selections in 3D environments. One of these techniques is ray pointing, which makes selections b...
Greg S. Schmidt, Dennis G. Brown, Erik B. Tomlin, ...