Sciweavers

2100 search results - page 172 / 420
» Fundamentals of the problem
Sort
View
101
Voted
SIGCSE
2008
ACM
103views Education» more  SIGCSE 2008»
15 years 22 days ago
A query simulation system to illustrate database query execution
The underlying processes that enable database query execution are fundamental to understanding database management systems. However, these processes are complex and can be difficu...
Brett Allenstein, Andrew Yost, Paul Wagner, Joline...
IJNSEC
2007
127views more  IJNSEC 2007»
15 years 22 days ago
Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
Tsz-Yeung Wong, John Chi-Shing Lui, Man Hon Wong
CAGD
2004
76views more  CAGD 2004»
15 years 21 days ago
Topologically consistent trimmed surface approximations based on triangular patches
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...
Rida T. Farouki, Chang Yong Han, Joel Hass, Thomas...
134
Voted
DC
2002
15 years 19 days ago
Handling message semantics with Generic Broadcast protocols
Message ordering is a fundamental abstraction in distributed systems. However, ordering guarantees are usually purely "syntactic," that is, message "semantics" ...
Fernando Pedone, André Schiper
103
Voted
ITA
2000
15 years 19 days ago
Construction of very hard functions for multiparty communication complexity
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
Ján Manuch