Sciweavers

4781 search results - page 415 / 957
» Complexity at large
Sort
View
INFOCOM
2000
IEEE
15 years 9 months ago
Networks with Advance Reservations: The Routing Perspective
— This paper provides an initial look at how support for advance reservations affects the complexity of the path selection process in networks. Advance reservations are likely to...
Roch Guérin, Ariel Orda
169
Voted
COLT
2000
Springer
15 years 9 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
ICPP
1999
IEEE
15 years 9 months ago
Improving Performance of Load-Store Sequences for Transaction Processing Workloads on Multiprocessors
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
Jim Nilsson, Fredrik Dahlgren
DEXAW
1998
IEEE
116views Database» more  DEXAW 1998»
15 years 9 months ago
Data-Mining: A Tightly-Coupled Implementation on a Parallel Database Server
Due to the increasingly di culty of discovering patterns in real-world databases using only conventional OLAP tools, an automated process such as data mining is currently essentia...
Mauro Sousa, Marta Mattoso, Nelson F. F. Ebecken
161
Voted
SAFECOMP
1999
Springer
15 years 9 months ago
Hierarchically Performed Hazard Origin and Propagation Studies
Abstract. This paper introduces a new method for safety analysis called HiPHOPS (Hierarchically Performed Hazard Origin and Propagation Studies). HiP-HOPS originates from a number ...
Yiannis Papadopoulos, John A. McDermid