Sciweavers

5030 search results - page 264 / 1006
» cases 2007
Sort
View
DLT
2006
15 years 8 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
DGO
2003
79views Education» more  DGO 2003»
15 years 8 months ago
Finding Outliers in Models of Spatial Data
Statistical models fit to data often require extensive and challenging re-estimation before achieving final form. For example, outliers can adversely affect fits. In other cas...
David W. Scott, J. Blair Christian
NETWORKING
2004
15 years 8 months ago
Loss Strategies for Competing TCP/IP Connections
We study in this paper two competing TCP connections that share a common bottleneck link. When congestion occurs, one (or both) connections will suffer a loss that will cause its t...
Eitan Altman, Rachid El Azouzi, David Ros, Bruno T...
OPODIS
2004
15 years 8 months ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...
IJCAI
2003
15 years 8 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov