Sciweavers

2376 search results - page 255 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 9 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
SMA
1999
ACM
100views Solid Modeling» more  SMA 1999»
14 years 1 months ago
Matchmaker: manifold BReps for non-manifold r-sets
Many solid modeling construction techniques produce non-manifold r-sets (solids). With each non-manifold model N we can associate a family of manifold solid models that are infini...
Jarek Rossignac, David E. Cardoze
BMCBI
2011
13 years 4 months ago
Simulated evolution applied to study the genetic code optimality using a model of codon reassignments
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...
Jose Santos, Ángel Monteagudo
ATAL
2006
Springer
14 years 1 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
IJNSEC
2006
94views more  IJNSEC 2006»
13 years 9 months ago
A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...
Sangook Moon