Sciweavers

1539 search results - page 187 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
ICDE
2006
IEEE
225views Database» more  ICDE 2006»
14 years 4 months ago
Continuous Reverse Nearest Neighbor Monitoring
Continuous spatio-temporal queries have recently received increasing attention due to the abundance of location-aware applications. This paper addresses the Continuous Reverse Nea...
Tian Xia, Donghui Zhang
TCOM
2010
112views more  TCOM 2010»
13 years 8 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
AIMS
2007
Springer
14 years 4 months ago
Modeling Change Without Breaking Promises
Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change ov...
Alva L. Couch, Hengky Susanto, Marc Chiarini
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 3 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
DSN
2005
IEEE
14 years 3 months ago
Defeating Memory Corruption Attacks via Pointer Taintedness Detection
Most malicious attacks compromise system security through memory corruption exploits. Recently proposed techniques attempt to defeat these attacks by protecting program control da...
Shuo Chen, Jun Xu, Nithin Nakka, Zbigniew Kalbarcz...