Sciweavers

1017 search results - page 96 / 204
» Some existence and construction results of polygonal designs
Sort
View
ECML
2006
Springer
15 years 10 months ago
Combinatorial Markov Random Fields
Abstract. A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatoria...
Ron Bekkerman, Mehran Sahami, Erik G. Learned-Mill...
SIGMOD
2004
ACM
118views Database» more  SIGMOD 2004»
16 years 6 months ago
Effective Use of Block-Level Sampling in Statistics Estimation
Block-level sampling is far more efficient than true uniform-random sampling over a large database, but prone to significant errors if used to create database statistics. In this ...
Surajit Chaudhuri, Gautam Das, Utkarsh Srivastava
GLOBECOM
2007
IEEE
16 years 22 days ago
Adaptive Mobility Management for IP/MPLS-Based Wireless Networks: A Proposal and Analysis
Abstract—In this paper, we propose a new adaptive MPLSenabled micro-mobility management scheme designed to track efficiently the mobility of nodes so as to minimize both handoff...
Rami Langar, Nizar Bouabdallah, Raouf Boutaba
NIXDORF
1992
116views Hardware» more  NIXDORF 1992»
15 years 10 months ago
Programmable Active Memories: A Performance Assessment
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
Patrice Bertin, Didier Roncin, Jean Vuillemin
LATIN
2010
Springer
15 years 11 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri