1068 search results - page 190 / 214 » Factorization as a Rank 1 Problem |
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
GFKL
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This study focuses on the contribution of sentence length for a quantitative text typology. Therefore, 333 Slovenian texts are analyzed with regard to their sentence leng...
116
click to vote
UPP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
DIALM
2003
ACM
15 years 3 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...