Sciweavers

10792 search results - page 334 / 2159
» An Evaluation of Non-Equijoin Algorithms
Sort
View
AAAI
2010
15 years 7 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
TCS
2008
15 years 6 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
TSP
2008
105views more  TSP 2008»
15 years 6 months ago
Code-Assisted Synchronization for UWB-IR Systems: Algorithms and Analysis
Timing synchronization is a critical challenge in ultra-wideband impulse radios (UWB-IRs). Conventional fulldigital synchronization methods encounter implementation difficulties su...
Yeqiu Ying, Mounir Ghogho, Ananthram Swami
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
16 years 8 months ago
Confidence-Aware Join Algorithms
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
Parag Agrawal, Jennifer Widom
MICCAI
2008
Springer
16 years 8 months ago
New Algorithms to Map Asymmetries of 3D Surfaces
Abstract. In this paper, we propose a set of new generic automated processing tools to characterise the local asymmetries of anatomical structures (represented by surfaces) at an i...
Benoît Combès, Sylvain Prima