Sciweavers

71 search results - page 11 / 15
» On the Complexity of Reliable Root Approximation
Sort
View
CCR
2005
131views more  CCR 2005»
13 years 7 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...
SSDBM
2006
IEEE
139views Database» more  SSDBM 2006»
14 years 1 months ago
Sampling Trajectory Streams with Spatiotemporal Criteria
Monitoring movement of high-dimensional points is essential for environmental databases, geospatial applications, and biodiversity informatics as it reveals crucial information ab...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
ALMOB
2006
80views more  ALMOB 2006»
13 years 7 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
TEC
2008
104views more  TEC 2008»
13 years 7 months ago
Coevolution of Fitness Predictors
Abstract--We present an algorithm that coevolves fitness predictors, optimized for the solution population, which reduce fitness evaluation cost and frequency, while maintaining ev...
Michael D. Schmidt, Hod Lipson
INFOCOM
2002
IEEE
14 years 17 days ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...