Sciweavers

2814 search results - page 75 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ICCI
1993
14 years 2 months ago
The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases
Locking and timestamping are two popular approaches to concurrency control in databases systems. Although more than a dozen analytic performance studies of locking techniques have...
Christos Bouras, Paul G. Spirakis
PERCOM
2004
ACM
14 years 9 months ago
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
Regina Bischoff, Roger Wattenhofer
ICML
2006
IEEE
14 years 10 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
MM
2003
ACM
146views Multimedia» more  MM 2003»
14 years 3 months ago
Supporting timeliness and accuracy in distributed real-time content-based video analysis
Real-time content-based access to live video data requires content analysis applications that are able to process the video data at least as fast as the video data is made availab...
Viktor S. Wold Eide, Frank Eliassen, Ole-Christoff...
ILP
2003
Springer
14 years 3 months ago
Applying Theory Revision to the Design of Distributed Databases
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...
Fernanda Araujo Baião, Marta Mattoso, Jude ...