Sciweavers

7049 search results - page 235 / 1410
» Data Abstraction for CSP-OZ
Sort
View
ECML
2005
Springer
16 years 4 days ago
Learning from Positive and Unlabeled Examples with Different Data Distributions
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
Xiaoli Li, Bing Liu
PAM
2005
Springer
16 years 3 days ago
On the Stationarity of TCP Bulk Data Transfers
Abstract. While the Internet offers a single best-effort service, we remark that (i) core backbones are in general over provisioned, (ii) end users have increasingly faster acces...
Guillaume Urvoy-Keller
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
16 years 2 days ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
Filippo Geraci, Roberto Grossi
ICA3PP
2005
Springer
16 years 2 days ago
Data Distribution Strategies for Domain Decomposition Applications in Grid Environments
Abstract. In this paper, we evaluate message-passing applications in Grid environments using domain decomposition technique. We compare two domain decomposition strategies: a balan...
Beatriz Otero, José M. Cela, Rosa M. Badia,...
ICFEM
2004
Springer
15 years 12 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom