Sciweavers

865 search results - page 171 / 173
» Random graph models for the web graph
Sort
View
NLP
2000
13 years 9 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
AML
2007
68views more  AML 2007»
13 years 6 months ago
A note on weak dividing
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...
Byunghan Kim, Niandong Shi
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 5 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
NETWORK
2007
234views more  NETWORK 2007»
13 years 5 months ago
Surveillance Wireless Sensor Networks: Deployment Quality Analysis
Surveillance wireless sensor networks are deployed at perimeter or border locations to detect unauthorized intrusions. For deterministic deployment of sensors, the quality of depl...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
WWW
2007
ACM
14 years 6 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...