Sciweavers

1078 search results - page 128 / 216
» Analyzing DB2 Data Sharing Performance Problems
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
14 years 1 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
CCR
1998
75views more  CCR 1998»
13 years 10 months ago
A comparative analysis of groupware application protocols
Two of the most difficult problems faced by developers of synchronous groupware applications are the handling of multiple session connections and the maintenance of replicated dat...
Mark Pendergast
WWW
2010
ACM
14 years 3 months ago
Keyword search over key-value stores
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
Arash Termehchy, Marianne Winslett
NIPS
1998
13 years 11 months ago
Efficient Bayesian Parameter Estimation in Large Discrete Domains
In this paper we examine the problem of estimating the parameters of a multinomial distribution over a large number of discreteoutcomes,most of which do not appearin the training ...
Nir Friedman, Yoram Singer
CVPR
2011
IEEE
13 years 8 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes