Sciweavers

17541 search results - page 180 / 3509
» Complexity in scalable computing
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 3 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
123
Voted
EDBT
2004
ACM
133views Database» more  EDBT 2004»
16 years 3 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
121
Voted
VTC
2008
IEEE
123views Communications» more  VTC 2008»
15 years 9 months ago
A Low-Complexity Iterative Power Allocation Scheme for Multiuser OFDM Systems
—Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for future wide-area mobile communications, which can provide scalable high data rate tra...
Chin-Liang Wang, Chiuan-Hsu Chen
JNSM
2010
110views more  JNSM 2010»
14 years 10 months ago
Distributed Automatic Configuration of Complex IPsec-Infrastructures
The Internet Protocol Security Architecture IPsec is hard to deploy in large, nested, or dynamic scenarios. The major reason for this is the need for manual configuration of the cr...
Michael Rossberg, Guenter Schaefer, Thorsten Struf...
129
Voted
PDPTA
2007
15 years 4 months ago
Scalable Overlay Multicast Tree Construction for Media Streaming
Overlay networks have become popular in recent times for content distribution and end-system multicasting of media streams. In the latter case, the motivation is based on the lack...
Gabriel Parmer, Richard West, Gerald Fry