Sciweavers

3341 search results - page 657 / 669
» On Bounded Queries and Approximation
Sort
View
DEBS
2008
ACM
13 years 9 months ago
A framework for performance evaluation of complex event processing systems
Several new Complex Event Processing (CEP) engines have been recently released, many of which are intended to be used in performance sensitive scenarios - like fraud detection, tr...
Marcelo R. N. Mendes, Pedro Bizarro, Paulo Marques
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 7 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
BMCBI
2010
121views more  BMCBI 2010»
13 years 7 months ago
Knowledge-based annotation of small molecule binding sites in proteins
Background: The study of protein-small molecule interactions is vital for understanding protein function and for practical applications in drug discovery. To benefit from the rapi...
Ratna R. Thangudu, Manoj Tyagi, Benjamin A. Shoema...
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 7 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...
DKE
2008
79views more  DKE 2008»
13 years 7 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis