Sciweavers

2957 search results - page 379 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 12 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
RT
2004
Springer
15 years 12 months ago
Anti-aliasing and Continuity with Trapezoidal Shadow Maps
This paper proposes a new shadow map technique termed trapezoidal shadow maps to calculate high quality shadows in real-time applications. To address the resolution problem of the...
Tobias Martin, Tiow Seng Tan
IFIP
2003
Springer
15 years 11 months ago
Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets
Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, du...
Gil Zussman, Uri Yechiali, Adrian Segall
ECSQARU
2001
Springer
15 years 11 months ago
On Anytime Coherence-Based Reasoning
Abstract. A great deal of research has been devoted to nontrivial reasoning in inconsistent knowledge bases. Coherence-based approaches proceed by a consolidation operation which s...
Frédéric Koriche
IWQOS
2001
Springer
15 years 11 months ago
Aggregation and Scalable QoS: A Performance Study
The IETF’s Integrated Services (IntServ) architecture together with reservation aggregation provide a mechanism to support the quality-of-service demands of real-time flows in a...
Huirong Fu, Edward W. Knightly